Max Willert

most citedRouting in Unit Disk Graphs without Dynamic Headers

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CG2020★ 1 cited

Routing in Unit Disk Graphs without Dynamic Headers

Wolfgang Mulzer, Max Willert

Let $V \subset R^{2}$ be a set of $n$ sites in the plane. The unit disk graph $D G (V)$ of $V$ is the graph with vertex set $V$ in which two sites $v$ and $w$ are adjacent if an…

cs.CG2019

Routing in Histograms

Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5

Let $P$ be an $x$ -monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…