计算几何栏40
Computational Geometry Column 40
摘要:
最近,Below、De Loera和Richter-Gebert建立了一个理论,即找到凸多面体的最小尺寸(甚至只是一个小的)三角剖分是NP完全的。讨论了它们的3SAT约化证明。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。