Module spade::delaunay
[−]
[src]
A two dimensional delaunay triangulation.
Structs
CCWIterator |
An iterator that iterates over the outgoing edges from a vertex. |
DelaunayTriangulation |
A two dimensional delaunay triangulation. |
EdgeHandle |
A handle to a directed edge. |
FaceHandle |
A handle to a face. |
ONextIterator |
An iterator that iterates over the edges adjacent to a face. |
TriangulationWalkLocate |
Locate strategy that walks along the edges of a triangulation until the target point is found. This approach takes O(sqrt(n)) time on average, with a worst case of O(n) and a best case of O(1). |
VertexHandle |
A handle to a vertex. |
Enums
PositionInTriangulation |
Stores information about a point's position in triangulation. |
Traits
DelaunayLocateStructure |
Locate strategy for delaunay triangulations. |
Type Definitions
FixedEdgeHandle |
Handle to an edge. |
FixedFaceHandle |
Handle to a face. |
FixedVertexHandle |
Handle to a vertex. |
FloatDelaunayTriangulation |
Type shorthand for a delaunay triangulation with |
IntDelaunayTriangulation |
Type shorthand for a delaunay triangulation with |
RTreeDelaunayLocate |
Locate strategy that uses an r-tree to locate points in O(log(n)) time. |