Routing in polygonal domains

Bahareh Banyassady, Man Kwun Chiu, Matias Korman, Wolfgang Mulzer, André Van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert

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

2 Citations (Scopus)


We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a label and a routing table for each vertex. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node q and the routing table of the current node. For any fixed ϵ > 0, we present a routing scheme that always achieves a routing path that exceeds the shortest path by a factor of at most 1 + ϵ. The labels have O(log n) bits, and the routing tables are of size O((ϵ-1+h) log n). The preprocessing time is O(n2 log n+hn2+ ϵ-1hn). It can be improved to O(n2 + ϵ-1n) for simple polygons.

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


  • Polygonal domains
  • Routing scheme
  • Small stretch
  • Yao graph

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Routing in polygonal domains'. Together they form a unique fingerprint.

Cite this