Expand description
Constrained Delaunay Triangulation (CDT).
Implements an incremental CDT using a triangle-adjacency data structure.
Uses exact geometric predicates (orient2d and in_circle) for
robustness.
§Algorithm
- Point insertion: Bowyer-Watson incremental insertion with edge legalization.
- Constraint insertion: Sloan-style edge recovery by flipping intersecting edges.
- Exterior removal: Flood-fill from super-triangle, stopping at constrained edges.
Structs§
- Cdt
- Half-edge based Constrained Delaunay Triangulation.