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

一种新的区域旅游近似算法

New Approximation Algorithms for Touring Regions

Benjamin Qi, Richard Qi, Xinyang Chen

摘要:

我们分析了旅游区域问题:在$d$维空间中找到一条($1+ε$)近似的欧氏最短路径,该路径从给定的起点开始,在给定的终点结束,并按此顺序访问给定的区域$R_1, R_2, R_3, \dots, R_n$。我们的主要结果是一个$\mathcal O \left(\frac{n}{\sqrtε}\log{\frac{1}ε} + \frac{1}ε \right)$时间算法旅游不相交磁盘。我们还给出了游览不相交二维凸脂肪体的$\mathcal O\left (\min\left(\frac{n}ε, \frac{n^2}{\sqrt ε}\right) \right)$时间算法。这两个结果自然推广到更大的尺寸,我们得到$\mathcal O\left(\frac{n}{ε^{d-1}}\log^2\frac{1}ε+\frac{1}{ε^{2d-2}}\right)$和$\mathcal O\left(\frac{n}{ε^{2d-2}}\right)$时间算法旅游不相交的$d$维球和凸脂肪体,分别。

英文摘要:

We analyze the touring regions problem: find a ($1+ε$)-approximate Euclidean shortest path in $d$-dimensional space that starts at a given starting point, ends at a given ending point, and visits given regions $R_1, R_2, R_3, \dots, R_n$ in that order. Our main result is an $\mathcal O \left(\frac{n}{\sqrtε}\log{\frac{1}ε} + \frac{1}ε \right)$-time algorithm for touring disjoint disks. We also give an $\mathcal O\left (\min\left(\frac{n}ε, \frac{n^2}{\sqrt ε}\right) \right)$-time algorithm for touring disjoint two-dimensional convex fat bodies. Both of these results naturally generalize to larger dimensions; we obtain $\mathcal O\left(\frac{n}{ε^{d-1}}\log^2\frac{1}ε+\frac{1}{ε^{2d-2}}\right)$ and $\mathcal O\left(\frac{n}{ε^{2d-2}}\right)$-time algorithms for touring disjoint $d$-dimensional balls and convex fat bodies, respectively.

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

↑