The Complexity of Finding Small Triangulations of Convex 3-Polytopes
Combinatorics
2007-05-23 v1 Metric Geometry
Abstract
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.
Cite
@article{arxiv.math/0012177,
title = {The Complexity of Finding Small Triangulations of Convex 3-Polytopes},
author = {Alexander Below and Jesús A. De Loera and Jürgen Richter-Gebert},
journal= {arXiv preprint arXiv:math/0012177},
year = {2007}
}
Comments
37 pages. An earlier version containing the sketch of the proof appeared at the proceedings of SODA 2000