寻找凸3-多面体的小三角剖分的复杂性
组合数学
2007-05-23 v1 度量几何
摘要
证明了寻找具有较少四面体的凸三维多面体的三角剖分问题是NP难的。我们讨论了其他相关的复杂性结果。
引用
@article{arxiv.math/0012177,
title = {The Complexity of Finding Small Triangulations of Convex 3-Polytopes},
author = {Alexander Below and Jesús A. De Loera and Jürgen Richter-Gebert},
journal= {arXiv preprint arXiv:math/0012177},
year = {2007}
}
备注
37 pages. An earlier version containing the sketch of the proof appeared at the proceedings of SODA 2000