Optimal Tetrahedralizations of Some Convex Polyhedra.
Cao An Wang, Boting Yang · 2000
Abstract: In this paper, we investigate the problems of finding the `optimal ' tetrahedralization of a convex polyhedron in terms of minimum number of tetrahedra. We identify a class of convex polyhedra, called k-vertex emission tetrahedralizable polyhedra and prove that if a polyhedron contains an optimal solution of this type (denoted by k-opt), then it can be found in polynomial time for fixed k.