Routing on the visibility graph

Prosenjit Bose, Matias Korman, André Vanrenssen, Sander Verdonschot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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 points in the plane and let S be a set of non-crossing line segments whose endpoints are in P. We present two deterministic 1-local O(1)-memory routing algorithms that are guaranteed to find a path of at most linear size between any pair of vertices of 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 deterministic local routing algorithms, our routing algorithms do not route on a plane subgraph of the visibility graph.

Original languageEnglish
Title of host publication28th International Symposium on Algorithms and Computation, ISAAC 2017
EditorsTakeshi Tokuyama, Yoshio Okamoto
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770545
Publication statusPublished - 2017 Dec 1
Event28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, Thailand
Duration: 2017 Dec 92017 Dec 22

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Other28th International Symposium on Algorithms and Computation, ISAAC 2017


  • Constraints
  • Routing
  • Visibility graph
  • Θ-graph

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Routing on the visibility graph'. Together they form a unique fingerprint.

Cite this