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

直积图到摩托图的快速约简

Faster Reductions for Straight Skeletons to Motorcycle Graphs

John C. Bowers

摘要:

本文给出了一个算法,对于简单多边形,在$O(n\log n)$时间内将直骨架约简为摩托图,对于具有$m$连通分支的平面直线图,在$O(n(\log n)\log m)$时间内将直骨架约简为摩托图.这改进了以前最好的$O(n(\log n)\log r)$与$r$反射顶点(可能与孔)和$O(n^2\log n)$一般平面直线图的多边形。这使我们能够加快多边形和PSLG的直骨架算法。对于具有$h$孔和$r$反射顶点的多边形,我们在非退化情况下实现了从$O(n(\log n)\log r + r^{4/3+ε})$时间到$O(n(\log n)\log h + r^{4/3 + ε})$时间的加速,在退化情况下实现了从$O(n(\log n)\log r + r^{17/11 + ε})$到$O(n(\log n)\log h + r^{17/11 + ε})$的加速。对于具有$m$连通分支和$r$反射顶点的PSLG,在非退化情况下,我们获得了从$O(n^{1 + ε} + n^{8/11 + ε}r^{9/11+ε})$到$O(n(\log n)\log m + r^{4/3 + ε})$的加速,在退化情况下,我们获得了从$O(n^{1 + ε} + n^{8/11 + ε}r^{9/11+ε})$到$O(n(\log n)\log m + r^{17/11 + ε})$的加速.

英文摘要:

We give an algorithm that reduces the straight skeleton to the motorcycle graph in $O(n\log n)$ time for simple polygons and $O(n(\log n)\log m)$ time for a planar straight line graph (PSLG) with $m$ connected components. This improves on the previous best of $O(n(\log n)\log r)$ for polygons with $r$ reflex vertices (possibly with holes) and $O(n^2\log n)$ for general planar straight line graphs. This allows us to speed up the straight skeleton algorithm for polygons and PSLGs. For a polygon with $h$ holes and $r$ reflex vertices we achieve a speedup from $O(n(\log n)\log r + r^{4/3+ε})$ time to $O(n(\log n)\log h + r^{4/3 + ε})$ time in the non-degenerate case and from $O(n(\log n)\log r + r^{17/11 + ε})$ to $O(n(\log n)\log h + r^{17/11 + ε})$ in degenerate cases. For a PSLG with $m$ connected components and $r$ reflex vertices, we gain a speed up from $O(n^{1 + ε} + n^{8/11 + ε}r^{9/11+ε})$ to $O(n(\log n)\log m + r^{4/3 + ε})$ in the non-degenerate case and from $O(n^{1 + ε} + n^{8/11 + ε}r^{9/11+ε})$ to $O(n(\log n)\log m + r^{17/11 + ε})$ in the degenerate case.

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

↑