2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30440It 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 figuresComputational GeometryF.2.2; G.2.1text