Classes

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 1234]

▼Nboost
Chash< CDT::Edge >	Edge hasher
Chash< CDT::V2d< T > >
▼NCDT	Namespace containing triangulation functionality
▼Ndetail
CFixedCapacityQueue
Cless_than_x
Cless_than_y
CSplitMix64RandGen	SplitMix64 pseudo-random number generator
▼NKDTree
▼CKDTree	Simple tree structure with alternating half splitting nodes
CNode	Stores kd-tree node data
CNodeSplitDirection
CBox2d	2D bounding box
CDuplicatesInfo	Information about removed duplicated vertices
CDuplicateVertexError	Error thrown when duplicate vertex is detected during vertex insertion
CEdge	Edge connecting two vertices: vertex with smaller index is always first
CError	Base class for errors
CFinalizedError	Error thrown when triangulation modification is attempted after it was finalized
CIntersectingConstraintEdges	Enum of strategies for treating intersecting constraint edges
CIntersectingConstraintsError	Error thrown when intersecting constraint edges are detected, but triangulation is not configured to attempt to resolve them
CLocatorKDTree	KD-tree holding points
CPtLineLocation	Relative location of point to a line
CPtTriLocation	Location of point on a triangle
CSourceLocation	Contains source location info: file, function, line
CSuperGeometryType	Enum of what type of geometry used to embed triangulation into
CTriangle	Triangulation triangle (counter-clockwise winding)
CTriangulation	Data structure representing a 2D constrained Delaunay triangulation
CV2d	2D vector
CVertexInsertionOrder	Enum of strategies specifying order in which a range of vertices is inserted