2000/10/31 by Joseph O'Rourke, O'Rourke, Joseph
Computer Science · #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #G.2.1 #cs.CG
paper · pdf · doi:10.48550/arxiv.cs/0010039
3 pages; 4 figures
arxiv created 2000/10/31 · arxiv updated 2009/11/30
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.