Constrained Delaunay triangulation: Difference between revisions

Revision as of 18:30, 26 March 2011

Revision as of 16:50, 2 October 2011

Line 1:

In [[computational geometry]], a '''constrained Delaunay triangulation''' is a generalization of the [[Delaunay triangulation]] that forces certain required segments into the triangulation<ref>{{cite conference | first1=L. Paul| last1=Chew| title=Constrained Delaunay Triangulations | booktitle=Proceedings of the Third Annual Symposium on Computational Geometry | year=1987}}</ref><ref>

{{cite journal | first1=Jonathan R. | last1=Shewchuk| title=General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties | booktitle=Discrete & Computational Geometry | year=2008 | volume=39 | issue=1-3 | pages=580–637}}</ref>. 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 ==