A combinatorial bound for beacon-based routing in orthogonal polygons

DOI10.20382/JOCG.V13I1A2MaRDI QIDQ5077653zbMATH OpenFDO

Authors Thomas C. Shermer

Publication date 18 May 2022

Full work available at URL https://arxiv.org/abs/1507.03509

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10) Helly-type theorems and geometric transversal theory (52A35)

Recommendations

• Beacon-based algorithms for geometric routing
• An optimal algorithm to compute the inverse beacon attraction region
• Routing in a polygonal terrain with the shortest beacon watchtower

Cited in

(5)

• An optimal algorithm to compute the inverse beacon attraction region
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
• Tight bounds for beacon-based coverage in simple rectilinear polygons
• Beacon-based algorithms for geometric routing

This page was built for publication: A combinatorial bound for beacon-based routing in orthogonal polygons

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