Constrained Delaunay triangulation: Difference between revisions

Content deleted Content added
Creating stub page.
 
Changing the stub...
Line 1:
{{mathcomp-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>.