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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have