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

一种计算摩托车图的快速算法

A Faster Algorithm for Computing Motorcycle Graphs

Antoine Vigneron, Lie Yan

摘要:

我们提出了一个新的算法来计算摩托车图,运行在O(n^(4/3+e))的时间为任何e>0,改进所有以前已知的算法。这一结果的主要应用是计算多边形的直骨架。它允许我们在O(n.sqrt(h+1)log^2(n)+n^(4/3+e))的期望时间内计算具有h个洞的非退化多边形的直骨架。如果所有的输入坐标都是O(log n)-bit有理数,我们可以在O(n.sqrt(h+1)log^3(n))的期望时间内计算一个(可能退化的)有h个洞的多边形的直骨架。特别是,这意味着如果所有输入坐标都是O(\log n)位有理数,我们可以在O(n.log^3(n))的预期时间内计算简单多边形的直骨架,而所有以前已知的算法在最坏情况下的运行时间都大于n^(3/2)。

英文摘要:

We present a new algorithm for computing motorcycle graphs that runs in O(n^(4/3+e)) time for any e>0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with h holes in O(n.sqrt(h+1)log^2(n)+n^(4/3+e)) expected time. If all input coordinates are O(log n)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with h holes in O(n.sqrt(h+1)log^3(n)) expected time. In particular, it means that we can compute the straight skeleton of a simple polygon in O(n.log^3(n)) expected time if all input coordinates are O(\log n)-bit rationals, while all previously known algorithms have worst-case running time larger than n^(3/2).

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

↑