arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.00679cs.CG
收藏

去除三角形间的深度环:一种生成三角形片段的有效算法

Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments

Mark de Berg

摘要:

25年前,Chazelle~ \emph{et al.}(FOCS 1991)研究了以下问题:是否有可能将${\Bbb R}^3$中的任何一组$n$线切割成次二次数量的片段,使得所得片段允许深度顺序?他们证明了一个$O(n^{9/4})$界的非常特殊的情况下,二分编织线。从那时起,只取得了很小的进展,直到最近Aronov和Sharir(STOC 2016)的突破,他们表明$O(n^{3/2}\mathrm{polylog}\; n)$片段足以用于任何一组线。在后续论文中,Aronov,Miller和Sharir(SODA 2017)证明了三角形的$O(n^{3/2+\varepsilon})$边界,但他们的方法导致了具有弯曲边界的块。此外,他们的方法使用多项式分区,目前还没有已知的算法。因此,这个问题最自然的版本仍然是开放的:我们能否将${\Bbb R}^3$中的任何$n$不相交三角形的集合切割成允许深度顺序的次二次数量的三角形片段?如果是这样,我们能有效地计算出削减吗?我们回答这个问题,提出了一个算法,将任何一组$n$不相交的三角形${\Bbb R}^3$到$O(n^{7/4}\mathrm{polylog}\; n)$三角片段,承认一个深度顺序。我们的算法的运行时间是$O(n^{3.69})$。我们还证明了一个精致的界限,取决于数量,$K$,三角形边缘的投影到$xy$平面之间的交叉点:我们表明,$O(n^{1+\varepsilon} + n^{1/4} K^{3/4}\mathrm{polylog}\; n)$片段足以获得一个深度顺序。这一结果扩展到$xy$ -单调曲面片有界的次数代数弧的常数,构成了第一次二次界曲面片。作为我们的方法的副产品,我们获得了一个更快的算法,以削减一组线到$O(n^{3/2}\mathrm{polylog}\; n)$片段,承认一个深度顺序。

英文摘要:

More than 25 years ago Chazelle~\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth order? They proved an $O(n^{9/4})$ bound for the very special case of bipartite weavings of lines. Since then only little progress was made, until a recent breakthrough by Aronov and Sharir (STOC 2016) who showed that $O(n^{3/2}\mathrm{polylog}\; n)$ fragments suffice for any set of lines. In a follow-up paper Aronov, Miller and Sharir (SODA 2017) proved an $O(n^{3/2+\varepsilon})$ bound for triangles, but their method results in pieces with curved boundaries. Moreover, their method uses polynomial partitions, for which currently no algorithm is known. Thus the most natural version of the problem is still wide open: Can we cut any collection of $n$ disjoint triangles in ${\Bbb R}^3$ into a subquadratic number of triangular fragments that admit a depth order? And if so, can we compute the cuts efficiently? We answer this question by presenting an algorithm that cuts any set of $n$ disjoint triangles in ${\Bbb R}^3$ into $O(n^{7/4}\mathrm{polylog}\; n)$ triangular fragments that admit a depth order. The running time of our algorithm is $O(n^{3.69})$. We also prove a refined bound that depends on the number, $K$, of intersections between the projections of the triangle edges onto the $xy$-plane: we show that $O(n^{1+\varepsilon} + n^{1/4} K^{3/4}\mathrm{polylog}\; n)$ fragments suffice to obtain a depth order. This result extends to $xy$-monotone surface patches bounded by a constant number of bounded-degree algebraic arcs, constituting the first subquadratic bound for surface patches. As a byproduct of our approach we obtain a faster algorithm to cut a set of lines into $O(n^{3/2}\mathrm{polylog}\; n)$ fragments that admit a depth order.

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

↑