Computational Geometry Column 40
Computational Geometry
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cs/0010039,
title = {Computational Geometry Column 40},
author = {Joseph O'Rourke},
journal= {arXiv preprint arXiv:cs/0010039},
year = {2007}
}
Comments
3 pages; 4 figures