检测弱单多边形
Detecting Weakly Simple Polygons
摘要:
平面中的闭曲线是弱单的,如果它是简单闭曲线序列的极限(在Fréchet度量中)。我们描述了一个算法来确定简单平面图中长度为n的闭行走是否在O(n log n)时间内是弱简单的,改进了Cortese等人的早期O(n^3)时间算法。[离散数学。2009]。作为一个直接推论,我们得到了第一个有效的算法,以确定是否一个任意的n-顶点多边形是弱简单的,我们的算法运行在O(n^2 log n)的时间。我们还描述了两个有趣的多边形类检测弱简单性在O(n log n)时间的算法。最后,我们讨论了几个以前发表的弱简单性定义中的细微错误。
英文摘要:
A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) of a sequence of simple closed curves. We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, improving an earlier O(n^3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As an immediate corollary, we obtain the first efficient algorithm to determine whether an arbitrary n-vertex polygon is weakly simple; our algorithm runs in O(n^2 log n) time. We also describe algorithms that detect weak simplicity in O(n log n) time for two interesting classes of polygons. Finally, we discuss subtle errors in several previously published definitions of weak simplicity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。