arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.01816cs.CG
收藏

线性时间和恒定工作空间中两个不相交多边形的公切线

Common tangents of two disjoint polygons in linear time and constant workspace

Mikkel Abrahamsen, Bartosz Walczak

摘要:

我们提供了一个非常简单的算法来计算两个不相交的简单多边形的所有(最多四个)公共切线。给定每个多边形作为其角点的循环顺序的只读数组,该算法在线性时间和恒定工作空间中运行,并且是第一个同时实现两个复杂度界限的算法。公共切线的集合提供了关于多边形的凸包的基本信息-它们是嵌套的、重叠的还是不相交的-并且我们的算法因此也决定了这种关系。

英文摘要:

We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant workspace and is the first to achieve the two complexity bounds simultaneously. The set of common tangents provides basic information about the convex hulls of the polygons---whether they are nested, overlapping, or disjoint---and our algorithm thus also decides this relationship.

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

↑