A faster algorithm for computing straight skeletons

From MaRDI portal




Abstract: We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n(logn)logr) time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected O(nsqrth+1log2n) time for a polygon with h holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we can compute the straight skeleton of a non-degenerate polygon in O(n(logn)logr+r4/3+varepsilon) time for any varepsilon>0. On degenerate input, our time bound increases to O(n(logn)logr+r17/11+varepsilon).











This page was built for publication: A faster algorithm for computing straight skeletons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921412)