Computing straight skeletons of planar straight-line graphs based on motorcycle graphs

We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a better worst-case complexity of O(n2 log n). Preliminary experiments with our implementation demonstrate that an actual runtime of O(n log n) can be expected in practice.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Stefan Huber, Martin Held
• Keywords: Algorithm, CCCG 2010, Computational Geometry, Planar Straight-line Graphs, Straight Skeletons