On Computing Straight Skeletons by Means of Kinetic Triangulations

DOI10.1007/978-3-642-33090-2_66zbMath1365.68447OpenAlexW70184648MaRDI QIDQ2912891

Martin Held, Stefan Huber, Peter Palfrader

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_66

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement ⋮ A faster algorithm for computing motorcycle graphs ⋮ Implementing straight skeletons with exact arithmetic: challenges and experiences

This page was built for publication: On Computing Straight Skeletons by Means of Kinetic Triangulations