182 citations · 515 across the 59 of their papers we have counts for
4 papers · 1 filter
Routing in Unit Disk Graphs
Haim Kaplan, Wolfgang Mulzer, Liam Roditty +1
Let be a set of sites. The unit disk graph on has vertex set and an edge between two distinct sites if and only if $…
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer +2
Let be a set of labeled points in the plane. The radial system of describes, for each , the order in which a ray that rotates around encounters the points i…
Time-Space Trade-offs for Triangulations and Voronoi Diagrams
Matias Korman, Wolfgang Mulzer, Andre van Renssen +3
Let be a planar -point set. A triangulation for is a maximal plane straight-line graph with vertex set . The Voronoi diagram for is the subdivision of the plane i…
The Dual Diameter of Triangulations
Matias Korman, Stefan Langerman, Wolfgang Mulzer +3
Let $\Poly$ be a simple polygon with vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded f…