Constrained Delaunay triangulation: Difference between revisions

Revision as of 22:21, 9 February 2011

Revision as of 22:29, 9 February 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>.

== See Also ==

* [[Chew's second algorithm]]

[[Delaunay triangulation]]

[[Chew's second algorithm]]

== References ==