Computational Geometry Column 40
arXiv:cs/0010039
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.
3 pages; 4 figures