Constrained Delaunay triangulation

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation.[1][2] Because a Delaunay triangulation is almost always unique, often a constrained Delaunay triangulation contains edges that do not satisfy the Delaunay condition. Thus a constrained Delaunay triangulation often is not a Delaunay triangulation itself.

See also[edit]

References[edit]

  1. ^ Chew, L. Paul (1987). "Proceedings of the Third Annual Symposium on Computational Geometry".  |chapter= ignored (help)
  2. ^ Shewchuk, Jonathan R. (2008). "Discrete & Computational Geometry" 39 (1-3). pp. 580–637.  |chapter= ignored (help)

External links[edit]

  • Daedalus Lib Open Source. Daedalus Lib manages fully dynamic constrained Delaunay triangulations.