On merging straight skeletons

Franz Aurenhammer, Michael Steinkogler

Research output: Contribution to conferencePaperResearch

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

Fingerprint

Motorcycles
Merging
Decomposition

Cite this

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

2018.

Research output: Contribution to conferencePaperResearch

@conference{30266a4c55e44db2bf33fce568f5642d,
title = "On merging straight skeletons",
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.",
author = "Franz Aurenhammer and Michael Steinkogler",
year = "2018",
language = "English",

}

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 -