The Complexity of Finding Small Triangulations of Convex 3-Polytopes
Skip to main content
eScholarship
Open Access Publications from the University of California

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 Location

https://arxiv.org/pdf/math/0012177.pdf
No data is associated with this publication.
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.

Item not freely available? Link broken?
Report a problem accessing this item