Chasing puppies: Mobile beacon routing on closed curves
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Chasing Puppies
Forlagets udgivne version, 3,08 MB, PDF-dokument
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 with unbounded speed along the curve as long as the Euclidean straight-line distance to the human is decreasing, so that it is always at a point on the curve where 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.
Originalsprog | Engelsk |
---|---|
Titel | 37th International Symposium on Computational Geometry, SoCG 2021 |
Redaktører | Kevin Buchin, Eric Colin de Verdiere |
Antal sider | 19 |
Forlag | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Publikationsdato | 2021 |
Artikelnummer | 5 |
ISBN (Elektronisk) | 9783959771849 |
DOI | |
Status | Udgivet - 2021 |
Begivenhed | 37th International Symposium on Computational Geometry, SoCG 2021 - Virtual, Buffalo, USA Varighed: 7 jun. 2021 → 11 jun. 2021 |
Konference
Konference | 37th International Symposium on Computational Geometry, SoCG 2021 |
---|---|
Land | USA |
By | Virtual, Buffalo |
Periode | 07/06/2021 → 11/06/2021 |
Navn | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Vol/bind | 189 |
ISSN | 1868-8969 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
ID: 273638336