Combinatorics of beacon-based routing in three dimensions

DOI10.1016/j.comgeo.2020.101667zbMath1474.68416arXiv1712.07416OpenAlexW3104830327MaRDI QIDQ5896866

Jonas Cleve, Wolfgang Mulzer

Publication date: 7 January 2021

Published in: Computational Geometry, LATIN 2018: Theoretical Informatics (Search for Journal in Brave)

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

zbMATH Keywords

polytopesthree dimensionsbeacon routing

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Negative instance for the edge patrolling beacon problem

Cites Work

• Unnamed Item
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Beacon-Based Algorithms for Geometric Routing
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• An optimal algorithm to compute the inverse beacon attraction region
• Visibility Algorithms in the Plane

This page was built for publication: Combinatorics of beacon-based routing in three dimensions