Standard
Chasing puppies : Mobile beacon routing on closed curves. / Abrahamsen, Mikkel; Erickson, Jeff; Kostitsyna, Irina; Löffler, Maarten; Miltzow, Tillmann; Urhausen, Jérôme; Vermeulen, Jordi; Viglietta, Giovanni.
37th International Symposium on Computational Geometry, SoCG 2021. red. / Kevin Buchin; Eric Colin de Verdiere. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. 5 (Leibniz International Proceedings in Informatics, LIPIcs, Bind 189).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Abrahamsen, M, Erickson, J, Kostitsyna, I, Löffler, M, Miltzow, T, Urhausen, J, Vermeulen, J & Viglietta, G 2021,
Chasing puppies: Mobile beacon routing on closed curves. i K Buchin & EC de Verdiere (red),
37th International Symposium on Computational Geometry, SoCG 2021., 5, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, bind 189, 37th International Symposium on Computational Geometry, SoCG 2021, Virtual, Buffalo, USA,
07/06/2021.
https://doi.org/10.4230/LIPIcs.SoCG.2021.5
APA
Abrahamsen, M., Erickson, J., Kostitsyna, I., Löffler, M., Miltzow, T., Urhausen, J., Vermeulen, J., & Viglietta, G. (2021).
Chasing puppies: Mobile beacon routing on closed curves. I K. Buchin, & E. C. de Verdiere (red.),
37th International Symposium on Computational Geometry, SoCG 2021 [5] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Bind 189
https://doi.org/10.4230/LIPIcs.SoCG.2021.5
Vancouver
Abrahamsen M, Erickson J, Kostitsyna I, Löffler M, Miltzow T, Urhausen J o.a.
Chasing puppies: Mobile beacon routing on closed curves. I Buchin K, de Verdiere EC, red., 37th International Symposium on Computational Geometry, SoCG 2021. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2021. 5. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 189).
https://doi.org/10.4230/LIPIcs.SoCG.2021.5
Author
Abrahamsen, Mikkel ; Erickson, Jeff ; Kostitsyna, Irina ; Löffler, Maarten ; Miltzow, Tillmann ; Urhausen, Jérôme ; Vermeulen, Jordi ; Viglietta, Giovanni. / Chasing puppies : Mobile beacon routing on closed curves. 37th International Symposium on Computational Geometry, SoCG 2021. red. / Kevin Buchin ; Eric Colin de Verdiere. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 189).
Bibtex
@inproceedings{7c13dd13c1ac4d069901d905cfc84725,
title = "Chasing puppies: Mobile beacon routing on closed curves",
abstract = "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.",
keywords = "Beacon routing, Generic smooth curves, Navigation, Puppies",
author = "Mikkel Abrahamsen and Jeff Erickson and Irina Kostitsyna and Maarten L{\"o}ffler and Tillmann Miltzow and J{\'e}r{\^o}me Urhausen and Jordi Vermeulen and Giovanni Viglietta",
year = "2021",
doi = "10.4230/LIPIcs.SoCG.2021.5",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Kevin Buchin and {de Verdiere}, {Eric Colin}",
booktitle = "37th International Symposium on Computational Geometry, SoCG 2021",
note = "37th International Symposium on Computational Geometry, SoCG 2021 ; Conference date: 07-06-2021 Through 11-06-2021",
}
RIS
TY - GEN
T1 - Chasing puppies
T2 - 37th International Symposium on Computational Geometry, SoCG 2021
AU - Abrahamsen, Mikkel
AU - Erickson, Jeff
AU - Kostitsyna, Irina
AU - Löffler, Maarten
AU - Miltzow, Tillmann
AU - Urhausen, Jérôme
AU - Vermeulen, Jordi
AU - Viglietta, Giovanni
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
KW - Beacon routing
KW - Generic smooth curves
KW - Navigation
KW - Puppies
U2 - 10.4230/LIPIcs.SoCG.2021.5
DO - 10.4230/LIPIcs.SoCG.2021.5
M3 - Article in proceedings
AN - SCOPUS:85108211822
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 37th International Symposium on Computational Geometry, SoCG 2021
A2 - Buchin, Kevin
A2 - de Verdiere, Eric Colin
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 7 June 2021 through 11 June 2021
ER -
