Constrained Delaunay triangulation

Constrained Delaunay triangulation

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

References

  1. ^ Chew, L. Paul (1987). "Constrained Delaunay Triangulations". Proceedings of the Third Annual Symposium on Computational Geometry. 
  2. ^ Shewchuk, Jonathan R. (2008). General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties. 39. pp. 580–637. 


P ≟ NP  This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it.