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 vertices, among which are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected time for a polygon with 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 time for any . On degenerate input, our time bound increases to .
Recommendations
Cited in
(14)- Implementing straight skeletons with exact arithmetic: challenges and experiences
- A fast straight-skeleton algorithm based on generalized motorcycle graphs
- Straight Skeletons of Three-Dimensional Polyhedra
- Sublinear randomized algorithms for skeleton decompositions
- Straight skeletons and mitered offsets of nonconvex polytopes
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons
- scientific article; zbMATH DE number 7760167 (Why is no real title available?)
- Motorcycle graphs and straight skeletons
- Fast skeleton construction
- On computing straight skeletons by means of kinetic triangulations
- Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
- scientific article; zbMATH DE number 2119657 (Why is no real title available?)
- A faster algorithm for computing straight skeletons
- Representing directed trees as straight skeletons
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)