| _placements | frechet::poly::Algorithm | protected |
| _status | frechet::poly::Algorithm | protected |
| _validPlacements | frechet::poly::Algorithm | protected |
| Algorithm() | frechet::poly::Algorithm | |
| binarySearch(const std::vector< double > &values, int lo, int hi, R(Algorithm::*decideFunction)(FreeSpace::ptr, reach::FSPath::ptr, double, bool), R &result) | frechet::poly::Algorithm | protected |
| binarySearch(const std::vector< double > &values, int lo, int hi, R(Algorithm::*decideFunction)(FreeSpace::ptr, reach::FSPath::ptr, double, bool), R &result) | frechet::poly::Algorithm | |
| bisector_distance(const Float &p1x, const Float &p1y, const Float &p2x, const Float &p2y, const Float &q1x, const Float &q1y, const Float &q2x, const Float &q2y, const Float &tolerance) | frechet::poly::Algorithm | protectedstatic |
| bisector_distance(const Point &q1, const Point &q2, const QLineF &segment, Float tolerance=0.0) | frechet::poly::Algorithm | protectedstatic |
| bisector_distance(const Float &p1x, const Float &p1y, const Float &p2x, const Float &p2y, const Float &q1x, const Float &q1y, const Float &q2x, const Float &q2y, const Float &tolerance) | frechet::poly::Algorithm | |
| bisector_distance(const Point &q1, const Point &q2, const QLineF &segment, Float tolerance) | frechet::poly::Algorithm | |
| c_diagonals() const | frechet::poly::Algorithm | |
| calculate_RG(int i) | frechet::poly::Algorithm | protected |
| calculatePlacements(int i, frechet::reach::Placements &result) | frechet::poly::Algorithm | protected |
| calculateReachabilityGraphs()=0 | frechet::poly::Algorithm | protectedpure virtual |
| calculateValidPlacements(double epsilon)=0 | frechet::poly::Algorithm | protectedpure virtual |
| calculateValidPlacements(poly::PolygonShortestPathsFS &spt, double epsilon, int di, int dj) | frechet::poly::Algorithm | protected |
| cancelFlag | frechet::poly::Algorithm | protected |
| canDecidePoly() const | frechet::poly::Algorithm | inline |
| canOptimiseCurve() const | frechet::poly::Algorithm | inline |
| canOptimisePoly() const | frechet::poly::Algorithm | inline |
| cleanup() | frechet::poly::Algorithm | protectedvirtual |
| collectCriticalValue(const accurate_float &x) | frechet::poly::Algorithm | protectedvirtual |
| collectCriticalValues(bool a, bool b, bool c, bool d) | frechet::poly::Algorithm | |
| collectCriticalValues_a() | frechet::poly::Algorithm | protected |
| collectCriticalValues_b(const Point &p, const Curve &Q) | frechet::poly::Algorithm | protected |
| collectCriticalValues_b(const Curve &P, const Curve &Q)=0 | frechet::poly::Algorithm | protectedpure virtual |
| collectCriticalValues_c(const QLineF &pseg, const Curve &Q) | frechet::poly::Algorithm | protected |
| collectCriticalValues_c(const Curve &P, const Curve &Q)=0 | frechet::poly::Algorithm | protectedpure virtual |
| collectCriticalValues_d(const QLineF &diagonal) | frechet::poly::Algorithm | protected |
| collectCriticalValues_d()=0 | frechet::poly::Algorithm | protectedpure virtual |
| COMBINE(reach::Graph::ptr A, int di, int dj)=0 | frechet::poly::Algorithm | protectedpure virtual |
| combineCriticalValues()=0 | frechet::poly::Algorithm | protectedpure virtual |
| create_CRG(int i, int j, Triangulation::Edge e)=0 | frechet::poly::Algorithm | protectedpure virtual |
| create_RG(int i)=0 | frechet::poly::Algorithm | protectedpure virtual |
| createValidPlacementGraph(int di, int dj) | frechet::poly::Algorithm | protected |
| CRG(int i, int j, Triangulation::Edge e=Triangulation::Edge())=0 | frechet::poly::Algorithm | protectedpure virtual |
| CRG_map | frechet::poly::Algorithm | protected |
| CriticalValueList typedef | frechet::poly::Algorithm | protected |
| criticalValues | frechet::poly::Algorithm | protected |
| currentCriticalValueList() | frechet::poly::Algorithm | virtual |
| d(int i) const | frechet::poly::Algorithm | inlineprotected |
| decideCurve(FreeSpace::ptr fs, reach::FSPath::ptr path, double ignored, bool update_status) | frechet::poly::Algorithm | |
| decidePolygon(FreeSpace::ptr fs, reach::FSPath::ptr path, double epsilon, bool update_status) | frechet::poly::Algorithm | |
| decompose(bool optimal) | frechet::poly::Algorithm | |
| diagonalEdge(int i) const | frechet::poly::Algorithm | protected |
| displayPTriangulation() | frechet::poly::Algorithm | inline |
| findFeasiblePath()=0 | frechet::poly::Algorithm | protectedpure virtual |
| frechet::poly::PolygonWorkerJob class | frechet::poly::Algorithm | friend |
| fs | frechet::poly::Algorithm | protected |
| getValidPlacements(int di, int dj) | frechet::poly::Algorithm | protected |
| GraphMap typedef | frechet::poly::Algorithm | protected |
| graphModel | frechet::poly::Algorithm | protected |
| GraphPtr typedef | frechet::poly::Algorithm | |
| initial_status | frechet::poly::Algorithm | protected |
| intervalSearch(double lower_bound, double upper_bound, double precision, R(Algorithm::*decideFunction)(FreeSpace::ptr, reach::FSPath::ptr, double, bool), R &result) | frechet::poly::Algorithm | protected |
| intervalSearch(double lower_bound, double upper_bound, double precision, R(Algorithm::*decideFunction)(FreeSpace::ptr, reach::FSPath::ptr, double, bool), R &result) | frechet::poly::Algorithm | |
| is_c_diagonal(int di, int dj) const | frechet::poly::Algorithm | |
| is_c_diagonal(Segment s) const | frechet::poly::Algorithm | |
| k() const | frechet::poly::Algorithm | inlineprotected |
| l() const | frechet::poly::Algorithm | inlineprotected |
| local_fs | frechet::poly::Algorithm | protected |
| mapKey(int di, int dj) | frechet::poly::Algorithm | protected |
| MERGE_inner(const reach::Graph::ptr A, const reach::Graph::ptr B)=0 | frechet::poly::Algorithm | protectedpure virtual |
| MERGE_outer(const reach::Graph::ptr A, const reach::Graph::ptr B)=0 | frechet::poly::Algorithm | protectedpure virtual |
| NO enum value | frechet::poly::Algorithm | |
| NOT_SET_UP enum value | frechet::poly::Algorithm | |
| optimisationResult(double epsilon) | frechet::poly::Algorithm | signal |
| optimiseCurve(double approximation=0.0) | frechet::poly::Algorithm | |
| optimisePolygon(reach::FSPath::ptr path, double approximation=0.0) | frechet::poly::Algorithm | |
| P | frechet::poly::Algorithm | protected |
| P_CONVEX enum value | frechet::poly::Algorithm | |
| P_EMPTY enum value | frechet::poly::Algorithm | |
| P_NOT_CLOSED enum value | frechet::poly::Algorithm | |
| P_NOT_COUNTER_CLOCKWISE enum value | frechet::poly::Algorithm | |
| P_NOT_SIMPLE enum value | frechet::poly::Algorithm | |
| partitions() const | frechet::poly::Algorithm | inlineprotected |
| pathUpdated(bool valid) | frechet::poly::Algorithm | signal |
| Pcurve() const | frechet::poly::Algorithm | inline |
| pickIntervalPoint(const Interval &j, int m=INT_MAX) | frechet::poly::Algorithm | static |
| PlacementMap typedef | frechet::poly::Algorithm | protected |
| PlacementVector typedef | frechet::poly::Algorithm | protected |
| polygonUtilities(bool primary) | frechet::poly::Algorithm | inline |
| ptr typedef | frechet::poly::Algorithm | |
| PTriangulation() | frechet::poly::Algorithm | inline |
| Q | frechet::poly::Algorithm | protected |
| Q_CONVEX enum value | frechet::poly::Algorithm | |
| Q_EMPTY enum value | frechet::poly::Algorithm | |
| Q_NOT_CLOSED enum value | frechet::poly::Algorithm | |
| Q_NOT_COUNTER_CLOCKWISE enum value | frechet::poly::Algorithm | |
| Q_NOT_SIMPLE enum value | frechet::poly::Algorithm | |
| Qcurve() const | frechet::poly::Algorithm | inline |
| QTriangulation() | frechet::poly::Algorithm | inline |
| removeDuplicates(CriticalValueList &vector) | frechet::poly::Algorithm | protected |
| resetStatus(bool stopping=false) | frechet::poly::Algorithm | slot |
| RUNNING enum value | frechet::poly::Algorithm | |
| RUNNING_APPROX_CURVE enum value | frechet::poly::Algorithm | |
| RUNNING_APPROX_POLY enum value | frechet::poly::Algorithm | |
| RUNNING_DECIDE_CURVE enum value | frechet::poly::Algorithm | |
| RUNNING_DECIDE_POLY enum value | frechet::poly::Algorithm | |
| RUNNING_OPT_CURVE enum value | frechet::poly::Algorithm | |
| RUNNING_OPT_POLY enum value | frechet::poly::Algorithm | |
| segment_distance(const QLineF &segment, const Point &q1) | frechet::poly::Algorithm | protectedstatic |
| segment_distance(const QLineF &segment, const Point &q1) | frechet::poly::Algorithm | |
| SET_UP enum value | frechet::poly::Algorithm | |
| setInitialStatus(Status) | frechet::poly::Algorithm | protected |
| setStatus(Status) | frechet::poly::Algorithm | protected |
| setup(Curve &aP, Curve &aQ, bool fixOrientation=false) | frechet::poly::Algorithm | |
| status() const | frechet::poly::Algorithm | inline |
| Status enum name | frechet::poly::Algorithm | |
| statusChanged() | frechet::poly::Algorithm | signal |
| swap() | frechet::poly::Algorithm | |
| testCancelFlag() | frechet::poly::Algorithm | protected |
| triangulate() | frechet::poly::Algorithm | virtual |
| updatePath(reach::FSPath::ptr path, GraphPtr result, double epsilon) | frechet::poly::Algorithm | protected |
| updatePath(reach::FSPath::ptr path, reach::Pointer startPointer, double epsilon) | frechet::poly::Algorithm | protected |
| YES enum value | frechet::poly::Algorithm | |
| ~Algorithm() | frechet::poly::Algorithm | virtual |