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.
Original language | English |
---|---|
Article number | 225 |
Pages (from-to) | 225-237 |
Number of pages | 12 |
Journal | Algorithms |
Volume | 15 |
Issue number | 7 |
DOIs | |
Publication status | Published - 2022 |
Keywords
- 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