Chasing Puppies: Mobile Beacon Routing on Closed Curves
Research output: Contribution to journal › Journal article › Research › peer-review
Documents
- Fulltext
Final published version, 4.06 MB, PDF document
We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his and others’ work on beacon-based routing. Consider a human and a puppy on a simple closed curve in the plane. The human can walk along the curve at bounded speed and change direction as desired. The puppy runs along the curve (faster than the human) always reducing the Euclidean straight-line distance to the human, and stopping only when the distance is locally minimal. Assuming that the curve is smooth (with some mild genericity constraints) or a simple polygon, we prove that the human can always catch the puppy in finite time. Our results hold regardless of the relative speeds of puppy and human, and even if the puppy’s speed is unbounded.
Original language | English |
---|---|
Journal | Journal of Computational Geometry |
Volume | 13 |
Issue number | 2 |
Pages (from-to) | 115-150 |
ISSN | 1920-180X |
DOIs | |
Publication status | Published - 2022 |
Event | 37th International Symposium on Computational Geometry, SoCG 2021 - Virtual, Buffalo, United States Duration: 7 Jun 2021 → 11 Jun 2021 |
Conference
Conference | 37th International Symposium on Computational Geometry, SoCG 2021 |
---|---|
Country | United States |
City | Virtual, Buffalo |
Period | 07/06/2021 → 11/06/2021 |
Bibliographical note
Publisher Copyright:
© 2022, Carleton University. All rights reserved.
ID: 344803409