Constrained Delaunay triangulation
From Infogalactic: the planetary knowledge core
In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation.[1][2] Because a Delaunay triangulation is almost always unique, often a constrained Delaunay triangulation contains edges that do not satisfy the Delaunay condition. Thus a constrained Delaunay triangulation often is not a Delaunay triangulation itself.
See also
References
<templatestyles src="Reflist/styles.css" />
Cite error: Invalid <references> tag; parameter "group" is allowed only.
<references />, or <references group="..." />External links
- Daedalus Lib Open Source. Daedalus Lib manages fully dynamic constrained Delaunay triangulations.
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
