The medial axis of the union of inner Voronoi balls in the plane

Computational Geometry(2012)

引用 9|浏览0
暂无评分
摘要
Consider a dense sampling S of the smooth boundary of a planar shape O, i.e., an open subset of R2. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particularly simple structure: it is the union of all Voronoi vertices inside O and the Voronoi edges connecting them. Therefore, the medial axis of the union of these inner balls can be computed more efficiently and robustly than for a general union of balls. Our algorithm requires only the computation of a single Delaunay triangulation which is of complexity O(nlogn), whereas the general algorithm needs two Delaunay triangulations and a power diagram of quadratic complexity in the number of inner Voronoi balls. Also, our solution yields robust results even without using exact arithmetic, because it avoids the computation of the power diagram of the inner Voronoi balls whose configuration is highly degenerate.
更多
查看译文
关键词
Medial axis,Union of balls,Voronoi diagram
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要