Computational Geometry Column 40
<|reference_start|>Computational Geometry Column 40: 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.<|reference_end|>
@article{o'rourke2000computational,
    title={Computational Geometry Column 40},
    author={Joseph O'Rourke},
    journal={arXiv preprint arXiv:cs/0010039},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0010039},
    primaryClass={cs.CG}
}