BuildLink(int v, int vTriangle, std::list< std::pair< int, int >> &link, bool &isOpen) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
ComputePSD(int v0, int v1, int v2) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
Connect(int tri, int adj, int v0, int v1) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
ConstrainedDelaunay2() | gte::ConstrainedDelaunay2< InputType, ComputeType > | |
Delaunay2() | gte::Delaunay2< InputType, ComputeType > | |
GetAdjacencies() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetAdjacencies(int i, std::array< int, 3 > &adjacencies) const | gte::Delaunay2< InputType, ComputeType > | |
GetAdjBoundary(int tri, int needBndVertex, int needAdjVIndex) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
GetAdjInterior(int tri, int v0, int v1) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
GetAndRemoveInsertionPolygon(int i, std::set< std::shared_ptr< Triangle >> &candidates, std::set< EdgeKey< true >> &boundary) | gte::Delaunay2< InputType, ComputeType > | protected |
GetContainingTriangle(Vector2< InputType > const &p, SearchInfo &info) const | gte::Delaunay2< InputType, ComputeType > | |
GetContainingTriangle(int i, std::shared_ptr< Triangle > &tri) const | gte::Delaunay2< InputType, ComputeType > | protected |
GetDimension() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetDuplicates() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetEpsilon() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetGraph() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetHull(std::vector< int > &hull) const | gte::Delaunay2< InputType, ComputeType > | |
GetIndexOfVertex(int tri, int v) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
GetIndices() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetIndices(int i, std::array< int, 3 > &indices) const | gte::Delaunay2< InputType, ComputeType > | |
GetLine() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetLinkTriangle(int v) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
GetNumTriangles() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetNumUniqueVertices() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetNumVertices() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetQuery() const | gte::Delaunay2< InputType, ComputeType > | inline |
GetVertices() const | gte::Delaunay2< InputType, ComputeType > | inline |
Insert(std::array< int, 2 > const &edge, std::vector< int > &outEdge) | gte::ConstrainedDelaunay2< InputType, ComputeType > | |
Insert(std::array< int, 2 > const &edge, int v0Triangle, std::vector< int > &outEdge) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
mAdjacencies | gte::Delaunay2< InputType, ComputeType > | protected |
mComputeVertices | gte::Delaunay2< InputType, ComputeType > | protected |
mDimension | gte::Delaunay2< InputType, ComputeType > | protected |
mDuplicates | gte::Delaunay2< InputType, ComputeType > | protected |
mEpsilon | gte::Delaunay2< InputType, ComputeType > | protected |
mGraph | gte::Delaunay2< InputType, ComputeType > | protected |
mIndex | gte::Delaunay2< InputType, ComputeType > | protected |
mIndices | gte::Delaunay2< InputType, ComputeType > | protected |
mLine | gte::Delaunay2< InputType, ComputeType > | protected |
mNumTriangles | gte::Delaunay2< InputType, ComputeType > | protected |
mNumUniqueVertices | gte::Delaunay2< InputType, ComputeType > | protected |
mNumVertices | gte::Delaunay2< InputType, ComputeType > | protected |
mQuery | gte::Delaunay2< InputType, ComputeType > | protected |
mVertices | gte::Delaunay2< InputType, ComputeType > | protected |
operator()(int numVertices, Vector2< InputType > const *vertices, InputType epsilon) | gte::ConstrainedDelaunay2< InputType, ComputeType > | |
ProcessCoincident(int tri, int v0, int v1, int vOther, std::vector< int > &outEdge) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
ProcessInterior(int tri, int v0, int v1, int vNext, int vPrev, std::vector< int > &outEdge) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
Retriangulate(std::vector< int > &polygon, std::vector< std::array< int, 2 >> const &lBoundary, std::vector< std::array< int, 2 >> const &rBoundary) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
RetriangulateLRecurse(std::vector< std::array< int, 2 >> const &lBoundary, int i0, int i1, int a0, std::vector< int > &polygon) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
RetriangulateRRecurse(std::vector< std::array< int, 2 >> const &rBoundary, int i0, int i1, int a0, std::vector< int > &polygon) | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
SelectSplit(std::vector< std::array< int, 2 >> const &boundary, int i0, int i1) const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
Trap() const | gte::ConstrainedDelaunay2< InputType, ComputeType > | private |
Triangle typedef | gte::Delaunay2< InputType, ComputeType > | protected |
Update(int i) | gte::Delaunay2< InputType, ComputeType > | protected |
~ConstrainedDelaunay2() | gte::ConstrainedDelaunay2< InputType, ComputeType > | virtual |
~Delaunay2() | gte::Delaunay2< InputType, ComputeType > | virtual |