The complexity of finding small triangulations of convex 3-polytopes

Abstract

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is NP -hard. We discuss other related complexity results. 
DOI: 10.1016/S0196-6774(03)00092-0

Topics

25 Figures and Tables

Cite this paper

@article{Below2004TheCO, title={The complexity of finding small triangulations of convex 3-polytopes}, author={Alexander Below and Jes{\'u}s A. De Loera and J{\"u}rgen Richter-Gebert}, journal={J. Algorithms}, year={2004}, volume={50}, pages={134-167} }