arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0804.4150cs.CCcs.CG
收藏

多面体的阴影和切片计算

On Computing the Shadows and Slices of Polytopes

Hans Raj Tiwary

摘要:

我们研究了计算任意$d$ -多面体沿$k$正交向量的各种输入和输出形式的投影的复杂性。我们表明,如果$d$和$k$是输入的一部分(即不是一个常数),我们感兴趣的输出敏感的算法,那么在大多数形式的问题是相当于枚举顶点的多面体,除了在两个地方,它是NP-难的。在另外两种形式中,这个问题是微不足道的。我们还回顾了计算投影的复杂性时,投影方向在某种意义上是非退化的。对于原点在内部的全维多面体,投影是与多面体相交于一个合适的线性子空间的对偶运算,因此本文的结果可以通过顶点与面的互换和投影与交的互换来对偶化。为了比较投影算法和顶点枚举算法的复杂性,我们在顶点枚举算法复杂性的基础上定义了新的复杂性类。

英文摘要:

We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing projections when the projection directions are in some sense non-degenerate. For full-dimensional polytopes containing origin in the interior, projection is an operation dual to intersecting the polytope with a suitable linear subspace and so the results in this paper can be dualized by interchanging vertices with facets and projection with intersection. To compare the complexity of projection and vertex enumeration, we define new complexity classes based on the complexity of Vertex Enumeration.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑