eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-12-07
18:1
18:12
10.4230/LIPIcs.ISAAC.2017.18
article
Routing on the Visibility Graph
Bose, Prosenjit
Korman, Matias
van Renssen, André
Verdonschot, Sander
We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let P be a set of n vertices in the plane and let S be a set of line segments between the vertices in P, with no two line segments intersecting properly. We present two 1-local O(1)-memory routing algorithms on the visibility graph of P with respect to a set of constraints S (i.e., the algorithms never look beyond the direct neighbours of the current location and store only a constant amount of information). Contrary to all existing routing algorithms, our routing algorithms do not require us to compute a plane subgraph of the visibility graph in order to route on it.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol092-isaac2017/LIPIcs.ISAAC.2017.18/LIPIcs.ISAAC.2017.18.pdf
Routing
constraints
visibility graph
Theta-graph