cdtr (Q7400302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Constrained Delaunay Triangulation with Refinement
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | cdtr |
Constrained Delaunay Triangulation with Refinement |
Statements
Binding to the 'CDT' header-only C++ library: constrained and conforming Delaunay triangulation, Ruppert refinement by area or minimum angle (Ruppert (1995) <doi:10.1006/jagm.1995.1021>), resolution of crossing constraints, and topological region depth per triangle. Also returns the provenance of each vertex and the input segments behind each constraint edge, so that the coverage of overlapping polygons and lines can be found from the mesh. The input and output follow the planar straight line graph form used by 'RTriangle'.
0 references
18 November 2026
0 references