Abstract
The search for efficient algorithms to compute the straight skeletons of a simple polygon has resulted in a variety of algorithms. We present a new approach that applies the divide-and-conquer paradigm with the divide step based on the motorcycle graph. A practical randomized algorithm is obtained that derives the straight skeleton from the motorcycle graph, with an expected running time of O(d n log n), where d is the decomposition depth of the motorcycle graph.
| Originalsprache | englisch |
|---|---|
| Titel | Proc. 34th European Workshop on Computational Geometry (EuroCG'18) |
| Erscheinungsort | Berlin, Germany |
| Seiten | #42 |
| Publikationsstatus | Veröffentlicht - 2018 |