论文信息 - Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement

Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement

Abstract We extend the work by Huber and Held (IJCGA 2012) on straight-skeleton computation based on motorcycle graphs to positively weighted skeletons. Resorting to a line arrangement induced by the r reflex vertices of a simple n-vertex polygon P allows to compute the weighted straight skeleton of P in O ( n 2 + r 3 k + n r log ⁡ n ) time and O ( n + k r ) space, for an arbitrary positive integer k ≤ r .

Martin Held | Günther Eder

[1] Antoine Vigneron,et al. A Faster Algorithm for Computing Straight Skeletons , 2016, TALG.

[2] Martin Held,et al. A Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs , 2012, Int. J. Comput. Geom. Appl..

[3] Franz Aurenhammer,et al. A Novel Type of Skeleton for Polygons , 1996 .

[4] Franz Aurenhammer,et al. Straight Skeletons for General Polygonal Figures in the Plane , 1996, COCOON.

[5] Peter Palfrader,et al. On Computing Straight Skeletons by Means of Kinetic Triangulations , 2012, ESA.

[6] David Eppstein,et al. Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions , 1998, SCG '98.

[7] Peter Palfrader,et al. Weighted straight skeletons in the plane☆ , 2013, CCCG.

[8] Antoine Vigneron,et al. A Faster Algorithm for Computing Motorcycle Graphs , 2014, Discret. Comput. Geom..