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

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