消除三维三角形间的深度环
Eliminating Depth Cycles among Triangles in Three Dimensions
摘要:
给定三维空间中的$n$两开不相交三角形,它们的垂直深度关系可能包含圈。我们表明,对于任何$\varepsilon>0$,三角形可以被切割成$O(n^{3/2+\varepsilon})$连接的半代数片,其描述的复杂性只取决于选择的$\varepsilon$,使这些片之间的深度关系是一个适当的偏序。在最坏的情况下,这个界限几乎是紧的。我们不知道任何以前的研究这个问题,在这个充分的一般性,与次二次约束的数量件。这项工作扩展了两位作者(Aronov,Sharir~2018)最近关于消除三维空间中线条之间的深度循环的研究。我们的方法是再次代数,并利用最近的变体的多项式分割技术,由于古斯,这导致了一个递归的程序切割的三角形。与线的情况相比,我们这里的分析要复杂得多,因为被切割对象的二维性质,所以需要使用拓扑学和代数等其他工具。我们的结果基本上解决了一个35岁的开放问题,在计算几何,在计算机图形学的隐藏表面去除的动机。
英文摘要:
Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose description complexity depends only on the choice of $\varepsilon$, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case. We are not aware of any previous study of this problem, in this full generality, with a subquadratic bound on the number of pieces. This work extends the recent study by two of the authors (Aronov, Sharir~2018) on eliminating depth cycles among lines in 3-space. Our approach is again algebraic, and makes use of a recent variant of the polynomial partitioning technique, due to Guth, which leads to a recursive procedure for cutting the triangles. In contrast to the case of lines, our analysis here is considerably more involved, due to the two-dimensional nature of the objects being cut, so additional tools, from topology and algebra, need to be brought to bear. Our result essentially settles a 35-year-old open problem in computational geometry, motivated by hidden-surface removal in computer graphics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。