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.Comment: 37 pages. An earlier version containing the sketch of the proof
  appeared at the proceedings of SODA 200

Below, Alexander

De Loera, Jesús A.

Richter-Gebert, Jürgen

English

arXiv

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

The Complexity of Finding Small Triangulations of Convex 3-Polytopes

Abstract

Similar works

Full text

Available Versions

eScholarship - University of California