### Abstract

Language | English |
---|---|

Status | Published - 2018 |

### Fingerprint

### Cite this

*On merging straight skeletons*.

**On merging straight skeletons.** / Aurenhammer, Franz; Steinkogler, Michael.

Research output: Contribution to conference › Paper › Research

}

TY - CONF

T1 - On merging straight skeletons

AU - Aurenhammer, Franz

AU - Steinkogler, Michael

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

M3 - Paper

ER -