Beacon-based algorithms for geometric routing

DOI10.1007/978-3-642-40104-6_14MaRDI QIDQ2842154zbMATH OpenOpenAlexFDO

Authors Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40104-6_14

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• A combinatorial bound for beacon-based routing in orthogonal polygons
• Routing in a polygonal terrain with the shortest beacon watchtower
• An optimal algorithm to compute the inverse beacon attraction region

Cited in

(15)

• Routing in a polygonal terrain with the shortest beacon watchtower
• Communication and location discovery in geometric ring networks
• Attraction-convexity and normal visibility
• Self-approaching paths in simple polygons
• Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
• Gathering by repulsion
• Tight bounds for beacon-based coverage in simple rectilinear polygons
• Negative instance for the edge patrolling beacon problem
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Triangulation and embedding using small sets of beacons
• A combinatorial bound for beacon-based routing in orthogonal polygons
• An optimal algorithm to compute the inverse beacon attraction region
• Gathering by repulsion
• A sub-quadratic time algorithm for computing the beacon kernel of simple polygons
• Chasing puppies: mobile beacon routing on closed curves

This page was built for publication: Beacon-based algorithms for geometric routing

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