Computational geometry column 40

Authors:
Joseph O'Rourke
Affiliations:
Dept. of Computer Science, Smith College, Northampton, MA
Venue:
ACM SIGACT News
Year:
2000

Citing 4
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
On the difficulty of triangulating three-dimensional nonconvex polyhedra.

Discrete & Computational Geometry
Triangulations

Handbook of discrete and computational geometry
The complexity of finding small triangulations of convex 3-polytopes

Journal of Algorithms - Special issue: SODA 2000

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.