Skip to main content
The Complexity of Finding Small Triangulations of Convex 3-Polytopes
- Author(s): Below, Alexander;
- De Loera, Jesús A.;
- Richter-Gebert, Jürgen
- et al.
Published Web Locationhttps://arxiv.org/pdf/math/0012177.pdf
No data is associated with this publication.
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
Item not freely available? Link broken?Report a problem accessing this item