Jump to content

Constrained Delaunay triangulation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RuppertsAlgorithm (talk | contribs) at 22:29, 9 February 2011 (Adding reference and a "see also" section.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

See Also

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)
  2. ^ Shewchuk, Jonathan R. (2008). "General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties". 39 (1–3): 580–637. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |booktitle= ignored (help)


P ≟ NP 

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Constrained_Delaunay_triangulation&oldid=412993617"