License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.18
URN: urn:nbn:de:0030-drops-82224
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8222/
Go to the corresponding LIPIcs Volume Portal


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

Routing on the Visibility Graph

pdf-format:
LIPIcs-ISAAC-2017-18.pdf (0.6 MB)


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 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.

BibTeX - Entry

@InProceedings{bose_et_al:LIPIcs:2017:8222,
  author =	{Prosenjit Bose and Matias Korman and Andr{\'e} van Renssen and Sander Verdonschot},
  title =	{{Routing on the Visibility Graph}},
  booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
  pages =	{18:1--18:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-054-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{92},
  editor =	{Yoshio Okamoto and Takeshi Tokuyama},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8222},
  URN =		{urn:nbn:de:0030-drops-82224},
  doi =		{10.4230/LIPIcs.ISAAC.2017.18},
  annote =	{Keywords: Routing, constraints, visibility graph, Theta-graph}
}

Keywords: Routing, constraints, visibility graph, Theta-graph
Seminar: 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Issue Date: 2017
Date of publication: 04.12.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI