Beacon-Based Algorithms for Geometric Routing

DOI10.1007/978-3-642-40104-6_14zbMath1390.68709OpenAlexW199000514MaRDI QIDQ2842154

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

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

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

Related Items (10)

Self-approaching paths in simple polygons ⋮ Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Routing in a polygonal terrain with the shortest beacon watchtower ⋮ Negative instance for the edge patrolling beacon problem ⋮ Gathering by repulsion ⋮ Combinatorics of beacon-based routing in three dimensions ⋮ Attraction-convexity and normal visibility ⋮ Tight bounds for beacon-based coverage in simple rectilinear polygons ⋮ Gathering by Repulsion. ⋮ An optimal algorithm to compute the inverse beacon attraction region

This page was built for publication: Beacon-Based Algorithms for Geometric Routing