Constrained Delaunay triangulation
In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation. 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.
- Chew, L. Paul (1987). "Constrained Delaunay Triangulations". Proceedings of the Third Annual Symposium on Computational Geometry.
- Shewchuk, Jonathan R. (2008). "General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties". Discrete & Computational Geometry 39 (1-3). pp. 580–637.
- http://totologic.blogspot.com/2013/11/incremental-constrained-delaunay.html Online incremental constrained Delaunay triangulation
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|