Routing in Simple Polygons

Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung

Abstract

A routing scheme $R$ in a network $G=(V,E)$ is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node $pin V$ and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label of the target and the routing table of the node that we are currently at). We present a routing scheme for routing in simple polygons: for any $varepsilon > 0$ the routing scheme provides a stretch of $1+, labels have $O(log n)$ bits, the corresponding routing tables are of size $O(-1log n)$, and the preprocessing time is $O(n^2+-1n)$. This improves the best known strategies for general graphs by Roditty and Tov (Distributed Computing 2016).
Originalspracheenglisch
TitelProceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)
ErscheinungsortMalmö, Sweden
Seiten17-20
Seitenumfang4
PublikationsstatusVeröffentlicht - 2017
Veranstaltung33rd European Workshop on Computational Geometry: EuroCG 2017 - Malmö, Schweden
Dauer: 5 Apr 20177 Apr 2017

Konferenz

Konferenz33rd European Workshop on Computational Geometry
KurztitelEuroCG 2017
LandSchweden
OrtMalmö
Zeitraum5/04/177/04/17

Fingerprint

Untersuchen Sie die Forschungsthemen von „Routing in Simple Polygons“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren