Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

DOI10.1007/978-3-662-49529-2_9MaRDI QIDQ2802931zbMATH OpenOpenAlexFDO

Authors Sang Won Bae, Chan-Su Shin, Antoine Vigneron

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

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

Recommendations

• Tight bounds for beacon-based coverage in simple rectilinear polygons
• A combinatorial bound for beacon-based routing in orthogonal polygons
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
• Beacon-based algorithms for geometric routing
• Optimal 2-coverage of a polygonal region in a sensor network
• Near-linear time approximation schemes for geometric maximum coverage
• Complete distributed coverage of rectilinear environments
• Linear Time Approximation Schemes for Geometric Maximum Coverage
• Triangulation and embedding using small sets of beacons

Cited in

(4)

• Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
• Tight bounds for beacon-based coverage in simple rectilinear polygons
• Triangulation and embedding using small sets of beacons
• An optimal algorithm to compute the inverse beacon attraction region

This page was built for publication: Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802931)