Incremental Construction of Motorcycle Graphs

Franz Aurenhammer, Christoph Ladurner, Michael Steinkogler*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number225
Pages (from-to)225-237
Number of pages12
Issue number7
Publication statusPublished - 2022


  • incremental algorithm
  • motorcycle graph
  • planar polygon
  • randomization
  • straight skeleton

ASJC Scopus subject areas

  • Computational Mathematics
  • Theoretical Computer Science
  • Numerical Analysis
  • Computational Theory and Mathematics

Fields of Expertise

  • Information, Communication & Computing


Dive into the research topics of 'Incremental Construction of Motorcycle Graphs'. Together they form a unique fingerprint.

Cite this