Finding minimal triangulations of convex 3-polytopes is NP-hard

Authors:
Alexander Below;Jesús A. De Loera;Jürgen Richter-Gebert
Affiliations:
Institut für Theoretische, Informatik, ETH Zürich;Dept of Mathematics, Univ. of California-Davis;Institut für Theoretische, Informatik, ETH Zürich
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Approximation for minimum triangulation of convex polyhedra

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms and Complexity for Tetrahedralization Detections

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Detecting tetrahedralizations of a set of line segments

Journal of Algorithms
Local polyhedra and geometric graphs

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

Computational Geometry: Theory and Applications
Local polyhedra and geometric graphs

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

Computational Geometry: Theory and Applications

Hi-index	0.00