Sciweavers

Share
CCCG
2003

The Strange Complexity of Constrained Delaunay Triangulation

10 years 5 months ago
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
Nicolas Grislain, Jonathan Richard Shewchuk
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where CCCG
Authors Nicolas Grislain, Jonathan Richard Shewchuk
Comments (0)
books