Constrained Delaunay triangulation: Difference between revisions

Revision as of 16:29, 17 November 2010

Revision as of 01:28, 19 November 2010

Line 1:

{{comp-sci-theory-stub}}

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>.

Line 6 ⟶ 4:

{{Reflist}}

{{Uncategorized|date=November 2010}}

{{comp-sci-theory-stub}}