小维有界面半空间交复杂性的界
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension
摘要:
研究了定义为n个半空间的交的D维多面体的组合复杂性,其性质是任何有界面的最高维数远小于D。我们证明了,如果d是有界面的最大维数,则多面体的顶点数为O(n^d),多面体的有界面总数为O(n^d^2).对于一般位置的输入,有界面的数量是O(n^d)。对于任何固定的d,我们展示了如何计算所有顶点的集合,如何确定多面体的有界面的最大维数,以及如何在多项式时间内计算有界面的集合,通过求解多项式数量的线性规划。
英文摘要:
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum dimension of a bounded face, then the number of vertices of the polyhedron is O(n^d) and the total number of bounded faces of the polyhedron is O(n^d^2). For inputs in general position the number of bounded faces is O(n^d). For any fixed d, we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a polynomial number of linear programs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。