An optimal algorithm to compute the inverse beacon attraction region

DOI10.4230/LIPIcs.SoCG.2018.55zbMath1489.68364arXiv1803.05946OpenAlexW2963753111MaRDI QIDQ5115823

Stefan Langerman, Irina Kostitsyna, Bahram Kouhestani, David Rappaport

Publication date: 18 August 2020

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

zbMATH Keywords

algorithmoptimalitybeacon attractioninverse attraction region

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (5)

Negative instance for the edge patrolling beacon problem ⋮ Gathering by repulsion ⋮ Combinatorics of beacon-based routing in three dimensions ⋮ Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks ⋮ An optimal algorithm to compute the inverse beacon attraction region

Cites Work

• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Routing in a polygonal terrain with the shortest beacon watchtower
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Beacon-Based Algorithms for Geometric Routing
• Euclidean shortest paths in the presence of rectilinear barriers
• A Lower Bound to Finding Convex Hulls
• An optimal algorithm to compute the inverse beacon attraction region
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: An optimal algorithm to compute the inverse beacon attraction region