Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.10
URN: urn:nbn:de:0030-drops-82379
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8237/
Banyassady, Bahareh ; Chiu, Man-Kwun ; Korman, Matias ; Mulzer, Wolfgang ; van Renssen, André ; Roeloffzen, Marcel ; Seiferth, Paul ; Stein, Yannik ; Vogtenhuber, Birgit ; Willert, Max
Routing in Polygonal Domains
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{banyassady_et_al:LIPIcs:2017:8237,
author = {Bahareh Banyassady and Man-Kwun Chiu and Matias Korman and Wolfgang Mulzer and Andr{\'e} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein and Birgit Vogtenhuber and Max Willert},
title = {{Routing in Polygonal Domains}},
booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages = {10:1--10:13},
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/8237},
URN = {urn:nbn:de:0030-drops-82379},
doi = {10.4230/LIPIcs.ISAAC.2017.10},
annote = {Keywords: polygonal domains, routing scheme, small stretch,Yao graph}
}
| Keywords: | polygonal domains, routing scheme, small stretch,Yao graph | |
| Seminar: | 28th International Symposium on Algorithms and Computation (ISAAC 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.12.2017 |
