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

研究成果: Conference contribution

2 被引用数 (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.

本文言語English
ホスト出版物のタイトル28th International Symposium on Algorithms and Computation, ISAAC 2017
編集者Takeshi Tokuyama, Yoshio Okamoto
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770545
DOI
出版ステータスPublished - 2017 12 1
イベント28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, Thailand
継続期間: 2017 12 92017 12 22

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
92
ISSN(印刷版)1868-8969

Other

Other28th International Symposium on Algorithms and Computation, ISAAC 2017
CountryThailand
CityPhuket
Period17/12/917/12/22

ASJC Scopus subject areas

  • Software

フィンガープリント 「Routing in polygonal domains」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル