@inproceedings{b9e1cb29736c466287b2cd42316ed7b1,

title = "Routing on the visibility graph",

abstract = "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.",

keywords = "Constraints, Routing, Visibility graph, Θ-graph",

author = "Prosenjit Bose and Matias Korman and Andr{\'e} Vanrenssen and Sander Verdonschot",

note = "Funding Information: ∗ P. B. is supported in part by NSERC. † M. K. was partially supported by MEXT KAKENHI Nos. 15H02665, and 17K12635. ‡ A. v. R. was supported by JST ERATO Grant Number JPMJER1201, Japan. § S. V. is supported in part by NSERC and the Carleton-Fields Postdoctoral Award.; 28th International Symposium on Algorithms and Computation, ISAAC 2017 ; Conference date: 09-12-2017 Through 22-12-2017",

year = "2017",

month = dec,

day = "1",

doi = "10.4230/LIPIcs.ISAAC.2017.18",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Takeshi Tokuyama and Yoshio Okamoto",

booktitle = "28th International Symposium on Algorithms and Computation, ISAAC 2017",

}