arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.13040cs.CGcs.DM
收藏

嵌套的接触多边形

Nesting of Touching Polygons

Carsten R. Seemann, Peter F. Stadler, Marc Hellmuth

AI总结:

本文针对可能沿边界接触的多边形集合,改编Bajaj和Dey的扫描线算法,提出一种运行时间为O(n+N log N)的嵌套判定算法,在每多边形最大伸展段有界时渐近最优,适用于凸多边形。

摘要:

多边形是嵌入平面中的环;其顶点与$x$坐标和$y$坐标相关联,边为直线。在此,我们考虑一组内部两两不重叠但可能沿边界接触的多边形。我们将Bajaj和Dey针对非接触多边形的扫描线算法思想进行改编,以容纳共享边界点的多边形。本文建立的算法实现了$\mathcal{O}(n+N\log N)$的运行时间,其中$n$是所有顶点的总数,$N<n$是所有多边形的“最大伸展段”的总数。如果每个多边形的最大伸展段数量有界,则该算法渐近最优。特别地,对于凸多边形,这一条件成立。

英文摘要:

Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their boundaries. Ideas of the sweep line algorithm by Bajaj and Dey for non-touching polygons are adapted to accommodate polygons that share boundary points. The algorithms established here achieves a running time of $\mathcal{O}(n+N\log N)$, where $n$ is the total number of vertices and $N<n$ is the total number of "maximal outstretched segments" of all polygons. It is asymptotically optimal if the number of maximal outstretched segments per polygon is bounded. In particular, this is the case for convex polygons.

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

↑