Routing on the visibility graph

DOI10.4230/LIPIcs.ISAAC.2017.18zbMath1457.68280arXiv1803.02979OpenAlexW3195048165MaRDI QIDQ5136234

André van Renssen, Sander Verdonschot, Prosenjit Bose, Matias Korman

Publication date: 25 November 2020

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

zbMATH Keywords

constraintsvisibility graphrouting\(\Theta\)-graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Routing among convex polygonal obstacles in the plane ⋮ Routing in polygonal domains

Cites Work

• Guide to wireless mesh networks
• On plane constrained bounded-degree spanners
• Competitive Local Routing with Constraints
• Survey on Oblivious Routing Strategies
• Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
• Constrained routing between non-visible vertices

This page was built for publication: Routing on the visibility graph