# Search Results

### Documents authored by Willert, Max

Document
##### Compact Routing in Unit Disk Graphs

Authors: Wolfgang Mulzer and Max Willert

Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)

##### Abstract
Let V ⊂ ℝ² be a set of n sites in the plane. The unit disk graph DG(V) of V is the graph with vertex set V where two sites v and w are adjacent if and only if their Euclidean distance is at most 1. We develop a compact routing scheme ℛ for DG(V). The routing scheme ℛ preprocesses DG(V) by assigning a label 𝓁(v) to every site v in V. After that, for any two sites s and t, the scheme ℛ must be able to route a packet from s to t as follows: given the label of a current vertex r (initially, r = s), the label of the target vertex t, and additional information in the header of the packet, the scheme determines a neighbor r' of r. Then, the packet is forwarded to r', and the process continues until the packet reaches its desired target t. The resulting path between the source s and the target t is called the routing path of s and t. The stretch of the routing scheme is the maximum ratio of the total Euclidean length of the routing path and of the shortest path in DG(V), between any two sites s, t ∈ V. We show that for any given ε > 0, we can construct a routing scheme for DG(V) with diameter D that achieves stretch 1+ε, has label size (1/ε)^{O(ε^(-2))} log Dlog³n/log log n, and the header has at most O(log²n/log log n) bits. In the past, several routing schemes for unit disk graphs have been proposed. Our scheme achieves poly-logarithmic label and header size, small stretch and does not use any neighborhood oracles.

##### Cite as

Wolfgang Mulzer and Max Willert. Compact Routing in Unit Disk Graphs. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

```@InProceedings{mulzer_et_al:LIPIcs.ISAAC.2020.16,
author =	{Mulzer, Wolfgang and Willert, Max},
title =	{{Compact Routing in Unit Disk Graphs}},
booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages =	{16:1--16:14},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-173-3},
ISSN =	{1868-8969},
year =	{2020},
volume =	{181},
editor =	{Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.16},
URN =		{urn:nbn:de:0030-drops-133602},
doi =		{10.4230/LIPIcs.ISAAC.2020.16},
annote =	{Keywords: routing scheme, unit disk graph, separator}
}```
Document
##### Stabbing Pairwise Intersecting Disks by Five Points

Authors: Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, and Max Willert

Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)

##### Abstract
Suppose we are given a set D of n pairwise intersecting disks in the plane. A planar point set P stabs D if and only if each disk in D contains at least one point from P. We present a deterministic algorithm that takes O(n) time to find five points that stab D. Furthermore, we give a simple example of 13 pairwise intersecting disks that cannot be stabbed by three points. This provides a simple - albeit slightly weaker - algorithmic version of a classical result by Danzer that such a set D can always be stabbed by four points.

##### Cite as

Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, and Max Willert. Stabbing Pairwise Intersecting Disks by Five Points. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 50:1-50:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

```@InProceedings{harpeled_et_al:LIPIcs.ISAAC.2018.50,
author =	{Har-Peled, Sariel and Kaplan, Haim and Mulzer, Wolfgang and Roditty, Liam and Seiferth, Paul and Sharir, Micha and Willert, Max},
title =	{{Stabbing Pairwise Intersecting Disks by Five Points}},
booktitle =	{29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages =	{50:1--50:12},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-094-1},
ISSN =	{1868-8969},
year =	{2018},
volume =	{123},
editor =	{Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.50},
URN =		{urn:nbn:de:0030-drops-99989},
doi =		{10.4230/LIPIcs.ISAAC.2018.50},
annote =	{Keywords: Disk graph, piercing set, LP-type problem}
}```
Document
##### Routing in Polygonal Domains

Authors: Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert

Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)

##### 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.

##### Cite as

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in Polygonal Domains. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

```@InProceedings{banyassady_et_al:LIPIcs.ISAAC.2017.10,
author =	{Banyassady, Bahareh and Chiu, Man-Kwun and Korman, Matias and Mulzer, Wolfgang and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Seiferth, Paul and Stein, Yannik and Vogtenhuber, Birgit and Willert, Max},
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 =	{Okamoto, Yoshio and Tokuyama, Takeshi},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.10},
URN =		{urn:nbn:de:0030-drops-82379},
doi =		{10.4230/LIPIcs.ISAAC.2017.10},
annote =	{Keywords: polygonal domains, routing scheme, small stretch,Yao graph}
}```
Document
##### Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries

Authors: Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, and Max Willert

Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)

##### Abstract
The chromatic art gallery problem asks for the minimum number of "colors" t so that a collection of point guards, each assigned one of the t colors, can see the entire polygon subject to some conditions on the colors visible to each point. In this paper, we explore this problem for orthogonal polygons using orthogonal visibility - two points p and q are mutually visible if the smallest axis-aligned rectangle containing them lies within the polygon. Our main result establishes that for a conflict-free guarding of an orthogonal n-gon, in which at least one of the colors seen by every point is unique, the number of colors is Theta(loglog n). By contrast, the best upper bound for orthogonal polygons under standard (non-orthogonal) visibility is O(log n) colors. We also show that the number of colors needed for strong guarding of simple orthogonal polygons, where all the colors visible to a point are unique, is Theta(log n). Finally, our techniques also help us establish the first non-trivial lower bound of Omega(loglog n / logloglog n) for conflict-free guarding under standard visibility. To this end we introduce and utilize a novel discrete combinatorial structure called multicolor tableau.

##### Cite as

Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, and Max Willert. Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 421-435, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

```@InProceedings{hoffmann_et_al:LIPIcs.SOCG.2015.421,
author =	{Hoffmann, Frank and Kriegel, Klaus and Suri, Subhash and Verbeek, Kevin and Willert, Max},
title =	{{Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries}},
booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
pages =	{421--435},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-83-5},
ISSN =	{1868-8969},
year =	{2015},
volume =	{34},
editor =	{Arge, Lars and Pach, J\'{a}nos},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.421},
URN =		{urn:nbn:de:0030-drops-50970},
doi =		{10.4230/LIPIcs.SOCG.2015.421},
annote =	{Keywords: Orthogonal polygons, art gallery problem, hypergraph coloring}
}```
X

Feedback for Dagstuhl Publishing