International Journal of Computational Geometry & Applications
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.
O'Rourke, Joseph, "Computational Geometry Column 40" (2000). Faculty Publications. Paper 65.