### Abstract

Original language | English |
---|---|

Title of host publication | Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017) |

Place of Publication | Malmö, Sweden |

Pages | 17-20 |

Number of pages | 4 |

Publication status | Published - 2017 |

### Fingerprint

### Cite this

*Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)*(pp. 17-20). Malmö, Sweden.

**Routing in Simple Polygons.** / Korman, Matias; Mulzer, Wolfgang; Renssen, André van; Roeloffzen, Marcel; Seiferth, Paul; Stein, Yannik; Vogtenhuber, Birgit; Willert, Max.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

*Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017).*Malmö, Sweden, pp. 17-20.

}

TY - GEN

T1 - Routing in Simple Polygons

AU - Korman, Matias

AU - Mulzer, Wolfgang

AU - Renssen, André van

AU - Roeloffzen, Marcel

AU - Seiferth, Paul

AU - Stein, Yannik

AU - Vogtenhuber, Birgit

AU - Willert, Max

PY - 2017

Y1 - 2017

N2 - 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).

AB - 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).

M3 - Conference contribution

SP - 17

EP - 20

BT - Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)

CY - Malmö, Sweden

ER -