Jump to content

Constrained Delaunay triangulation

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RuppertsAlgorithm (talk | contribs) at 16:29, 17 November 2010 (Changing the stub...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation[1].

References

  1. ^ Chew, L. Paul (1987). "Constrained Delaunay Triangulations". Proceedings of the Third Annual Symposium on Computational Geometry. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Constrained_Delaunay_triangulation&oldid=397327377"