Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

DOI10.1007/978-3-662-49529-2_9zbMath1411.52006OpenAlexW2405732189MaRDI QIDQ2802931

Sang Won Bae, Antoine Vigneron, Chan-Su Shin

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Combinatorics of beacon-based routing in three dimensions, An optimal algorithm to compute the inverse beacon attraction region