A simple algorithm for computing positively weighted straight skeletons of monotone polygons

Thérèse Biedl; Martin Held; Stefan G. Huber; Dominik Kaaser; Peter Palfrader

doi:https://doi.org/10.1016/j.ipl.2014.09.021

A simple algorithm for computing positively weighted straight skeletons of monotone polygons

Thérèse Biedl, Martin Held, Stefan G. Huber, Dominik Kaaser, Peter Palfrader · Information Processing Letters · 2014

We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlog⁡n) time and O(n) space, where n denotes the number of vertices of the polygon.

Read the paper · More papers on PaperTik