On merging straight skeletons

Franz Aurenhammer, Michael Steinkogler

Research output: Contribution to conferencePaper


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.
Original languageEnglish
Publication statusPublished - 2018


Dive into the research topics of 'On merging straight skeletons'. Together they form a unique fingerprint.

Cite this