Abstract
A beacon is a point-like object which can be enabled to exert a magnetic pull on other point-like objects in space. Those objects then move towards the beacon in a greedy fashion until they are either stuck at an obstacle or reach the beacon’s location. Beacons placed inside polyhedra can be used to route point-like objects from one location to another. A second use case is to cover a polyhedron such that every point-like object at an arbitrary location in the polyhedron can reach at least one of the beacons once the latter is activated.
The notion of beacon-based routing and guarding was introduced by Biro et al. [FWCG’11] in 2011 and covered in detail by Biro in his Ph.D. thesis [SUNY-SB’13], which focuses on the two-dimensional case.
We extend Biro’s result to three dimensions by considering beacon routing in polyhedra. We show that \(\lfloor {\frac{m+1}{3}}\rfloor \) beacons are always sufficient and sometimes necessary to route between any pair of points in a given polyhedron P, where m is the number of tetrahedra in a tetrahedral decomposition of P. This is one of the first results that show that beacon routing is also possible in three dimensions.
Supported in part by DFG grant MU 3501/1 and ERC StG 757609.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aldana Galván, I., Álvarez Rebollar, J.L., Catana Salazar, J.C., Marín Nevárez, N., Solís Villarreal, E., Urrutia, J., Velarde, C.: Beacon coverage in orthogonal polyhedra. In: 29th Canadian Conference on Computational Geometry (CCCG 2017), Ottawa, pp. 166–171, July 2017
Aldana-Galván, I., Álvarez-Rebollar, J.L., Catana-Salazar, J.C., Marín-Nevárez, N., Solís-Villarreal, E., Urrutia, J., Velarde, C.: Covering orthotrees with guards and beacons. In: XVII Spanish Meeting on Computational Geometry (XVII ECG), Alicante, June 2017
Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. Comput. Euclidean Geom. 4, 47–123 (1995)
Biro, M.: Beacon-based routing and guarding. Ph.D. thesis, State University of New York at Stony Brook (2013)
Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Beacon-based routing and coverage. In: 21st Fall Workshop on Computational Geometry (FWCG 2011) (2011)
Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Combinatorics of beacon-based routing and coverage. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), vol. 1, p. 3 (2013)
Chazelle, B.: Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput. 13(3), 488–507 (1984)
Cleve, J.: Combinatorics of beacon-based routing and guarding in three dimensions. Master’s thesis, Freie Universität Berlin, Berlin, March 2017
Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)
Lennes, N.J.: Theorems on the simple finite polygon and polyhedron. Am. J. Math. 33(1/4), 37 (1911)
Ruppert, J., Seidel, R.: On the difficulty of triangulating three-dimensional nonconvex polyhedra. Discret. Comput. Geom. 7(3), 227–253 (1992)
Shermer, T.C.: A combinatorial bound for beacon-based routing in orthogonal polygons. arXiv preprint arXiv:1507.03509 (2015)
Acknowledgments
We thank the anonymous reviewers for their thorough reading of the paper and helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Cleve, J., Mulzer, W. (2018). Combinatorics of Beacon-Based Routing in Three Dimensions. In: Bender, M., Farach-Colton, M., Mosteiro, M. (eds) LATIN 2018: Theoretical Informatics. LATIN 2018. Lecture Notes in Computer Science(), vol 10807. Springer, Cham. https://doi.org/10.1007/978-3-319-77404-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-77404-6_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77403-9
Online ISBN: 978-3-319-77404-6
eBook Packages: Computer ScienceComputer Science (R0)