Chasing Puppies: Mobile Beacon Routing on Closed Curves

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 well-behaved, we prove that the human can always catch the puppy in finite time, using a simple (but not quite trivial) strategy.

keywords: Computational Geometry, Graphs Theory, Trajectories

Conference Proceedings (peer-reviewed)

Giovanni Viglietta, Irina Kostitsyna, Jeff Erickson, Jordi L. Vermeulen, Jérôme Urhausen, Maarten Löffler, Mikkel Abrahamsen, Tillmann Miltzow
Chasing Puppies: Mobile Beacon Routing on Closed Curves
Proc. 37th International Symposium on Computational Geometry
5:1–5:19, 2021
https://drops.dagstuhl.de/opus/volltexte/2021/13804
Invited to Special Issue of JoCG

Archived Publication (not reviewed)

Giovanni Viglietta, Irina Kostitsyna, Jeff Erickson, Jordi L. Vermeulen, Jérôme Urhausen, Maarten Löffler, Mikkel Abrahamsen, Tillmann Miltzow
Chasing Puppies: Mobile Beacon Routing on Closed Curves
2103.09811, 2021
http://arXiv.org/abs/2103.09811

back to list