Max Willert

activity

20172020

most citedStabbing Pairwise Intersecting Disks by Five Points

13 citations · 19 across the 3 of their papers we have counts for

collaborators

4 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…

cs.CG2018★ 13 cited

Stabbing Pairwise Intersecting Disks by Five Points

Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer +4

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$ conta…

cs.CG2017★ 5 cited

Routing in Polygonal Domains

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman +7

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…