eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-12-07
10:1
10:13
10.4230/LIPIcs.ISAAC.2017.10
article
Routing in Polygonal Domains
Banyassady, Bahareh
Chiu, Man-Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max
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 eps > 0, we pre ent a routing scheme that always achieves a routing path that exceeds the shortest path by a factor of at most 1 + eps. The labels have O(log n) bits, and the routing tables are of size O((eps^{-1} + h) log n). The preprocessing time is O(n^2 log n + hn^2 + eps^{-1}hn). It can be improved to O(n 2 + eps^{-1}n) for simple polygons.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol092-isaac2017/LIPIcs.ISAAC.2017.10/LIPIcs.ISAAC.2017.10.pdf
polygonal domains
routing scheme
small stretch,Yao graph