Incremental Construction of Motorcycle Graphs

Franz Aurenhammer; Christoph Ladurner; Michael Steinkogler

doi:10.3390/a15070225

Incremental Construction of Motorcycle Graphs

Franz Aurenhammer, Christoph Ladurner, Michael Steinkogler^*

^*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

Abstract

We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is proposed.

Originalsprache	englisch
Aufsatznummer	225
Seiten (von - bis)	225-237
Seitenumfang	12
Fachzeitschrift	Algorithms
Jahrgang	15
Ausgabenummer	7
DOIs	https://doi.org/10.3390/a15070225
Publikationsstatus	Veröffentlicht - 2022

ASJC Scopus subject areas

Computational Mathematics
Theoretische Informatik
Numerische Mathematik
Theoretische Informatik und Mathematik

Fields of Expertise

Information, Communication & Computing

Zugriff auf Dokument

10.3390/a15070225Lizenz: CC BY 4.0

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@article{f87737a15d774a988c96e2b9ddfcba13,

title = "Incremental Construction of Motorcycle Graphs",

abstract = "We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is proposed.",

keywords = "incremental algorithm, motorcycle graph, planar polygon, randomization, straight skeleton",

author = "Franz Aurenhammer and Christoph Ladurner and Michael Steinkogler",

year = "2022",

doi = "10.3390/a15070225",

language = "English",

volume = "15",

pages = "225--237",

journal = "Algorithms",

issn = "1999-4893",

publisher = "MDPI AG",

number = "7",

}

TY - JOUR

T1 - Incremental Construction of Motorcycle Graphs

AU - Aurenhammer, Franz

AU - Ladurner, Christoph

AU - Steinkogler, Michael

PY - 2022

Y1 - 2022

N2 - We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is proposed.

AB - We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast. Various test data are given, and a clustering method for speeding up the construction is proposed.

KW - incremental algorithm

KW - motorcycle graph

KW - planar polygon

KW - randomization

KW - straight skeleton

UR - http://www.scopus.com/inward/record.url?scp=85133385053&partnerID=8YFLogxK

U2 - 10.3390/a15070225

DO - 10.3390/a15070225

M3 - Article

SN - 1999-4893

VL - 15

SP - 225

EP - 237

JO - Algorithms

JF - Algorithms

IS - 7

M1 - 225

ER -

Incremental Construction of Motorcycle Graphs

Abstract

ASJC Scopus subject areas

Fields of Expertise

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren