Abstract
Can an infinite-strength magnetic beacon always “catch” an iron ball, when the beacon is a point required to be remain nonstrictly outside a polygon, and the ball is a point always moving instantaneously and maximally toward the beacon subject to staying nonstrictly within the same polygon? Kouhestani and Rappaport [JCDCG 2017] gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strategy always exists. We disprove this conjecture by constructing orthogonal and general-position polygons in which the ball and the beacon can never be united.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biro, M.: Beacon-based routing and guarding. Ph.D. thesis, Stony Brook University, May 2013
Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.: Beacon-based routing and coverage. In: Abstracts from the 21st Fall Workshop on Computational Geometry (2011)
Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.: Combinatorics of beacon routing and coverage. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Canada, August 2013
Biro, M., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Beacon-based algorithms for geometric routing. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 158–169. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40104-6_14
Cleve, J., Mulzer, W.: Combinatorics of beacon-based routing in three dimensions. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 346–360. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77404-6_26
Kostitsyna, I., Kouhestani, B., Langerman, S., Rappaport, D.: An optimal algorithm to compute the inverse beacon attraction region. In: Speckmann, B., Tóth, C.D. (eds.) Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), volume 99 of LIPIcs, pp. 55:1–55:14, Budapest, Hungary, June 2018
Kouhestani, B.: Efficient algorithms for beacon routing in polygons. Ph.D. thesis, Queen’s University, Kingston, Canada (2017)
Kouhestani, B., Rappaport, D.: Edge patrolling beacon. In: Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, pp. 101–102 (2017)
Rappaport, D.: Personal communication held after the presentation of [8] (2017)
Shermer, T.C.: A combinatorial bound for beacon-based routing in orthogonal polygons. In: Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Ontario, pp. 213–219 (2015)
Acknowledgments
We thank Dylan Hendrickson for helpful discussions, and the anonymous referees for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Abel, Z. et al. (2021). Negative Instance for the Edge Patrolling Beacon Problem. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-90048-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-90047-2
Online ISBN: 978-3-030-90048-9
eBook Packages: Computer ScienceComputer Science (R0)