Routing in Unit Disk Graphs without Dynamic Headers

Wolfgang Mulzer, Max Willert

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