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

用直线和线段的排列构造多个面

Constructing Many Faces in Arrangements of Lines and Segments

Haitao Wang

摘要:

我们提出了新的算法来计算许多面临的安排线和段。给定一组$n$线(分别,段)和平面中的$m$点的集合$P$,问题是计算包含至少一个$P$点的$S$的布置的面。对于线路情况,我们给出了一个$O(m^{2/3}n^{2/3}\log^{2/3} (n/\sqrt{m})+(m+n)\log n)$时间的确定性算法。在某些情况下,这将以前最好的确定性算法[Agarwal,1990]改进了$\log^{2.22}n$的因子,并将以前最好的随机算法[Agarwal,Matoušek和Schwarzkopf,1998]改进了$\log^{1/3}n$的因子(例如,当为$m=Θ(n)$时)。对于分段情况,我们提出了一种$O(n^{2/3}m^{2/3}\log n+τ(nα^2(n)+n\log m+m)\log n)$时间的确定性算法,其中$τ=\min\{\log m,\log (n/\sqrt{m})\}$和$α(n)$是逆Ackermann函数.这将之前最好的确定性算法[Agarwal,1990]改进了一个因子$\log^{2.11}n$,并将之前最好的随机算法[Agarwal、Matoušek和Schwarzkopf,1998]改进了一个因子在某些情况下(例如,在某些情况下)改进了一个因子$\log n$当为$m=Θ(n)$时)。本文还给出了$O(m^{2/3}K^{1/3}\log n+τ(nα(n)+n\log m+m)\log n\log K)$期望时间的随机化算法,其中$K$是$S$中所有线段的交点数。此外,我们考虑的问题的查询版本,即预处理$S$计算面的安排$S$包含任何查询点。我们提出了新的结果,提高了以前的工作线和段的情况下。

英文摘要:

We present new algorithms for computing many faces in arrangements of lines and segments. Given a set $S$ of $n$ lines (resp., segments) and a set $P$ of $m$ points in the plane, the problem is to compute the faces of the arrangements of $S$ that contain at least one point of $P$. For the line case, we give a deterministic algorithm of $O(m^{2/3}n^{2/3}\log^{2/3} (n/\sqrt{m})+(m+n)\log n)$ time. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of $\log^{2.22}n$ and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of $\log^{1/3}n$ in certain cases (e.g., when $m=Θ(n)$). For the segment case, we present a deterministic algorithm of $O(n^{2/3}m^{2/3}\log n+τ(nα^2(n)+n\log m+m)\log n)$ time, where $τ=\min\{\log m,\log (n/\sqrt{m})\}$ and $α(n)$ is the inverse Ackermann function. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of $\log^{2.11}n$ and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of $\log n$ in certain cases (e.g., when $m=Θ(n)$). We also give a randomized algorithm of $O(m^{2/3}K^{1/3}\log n+τ(nα(n)+n\log m+m)\log n\log K)$ expected time, where $K$ is the number of intersections of all segments of $S$. In addition, we consider the query version of the problem, that is, preprocess $S$ to compute the face of the arrangement of $S$ that contains any query point. We present new results that improve the previous work for both the line and the segment cases.

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

↑