Paul Seiferth

collaborators

2 papers

cs.CG2019

Triangles and Girth in Disk Graphs and Transmission Graphs

Haim Kaplan, Katharina Klost, Wolfgang Mulzer +3

Let $S \subset R^{2}$ be a set of $n$ sites, where each $s \in S$ has an associated radius $r_{s} > 0$ . The disk graph $D (S)$ is the undirected graph with vertex set $S$ and a…

cs.CG2013

Greedy is as Good as Delaunay (Almost)

Wolfgang Mulzer, Paul Seiferth

Let S be a planar point set. Krznaric and Levcopoulos proved that given the Delaunay triangulation DT(S) for S, one can find the greedy triangulation GT(S) in linear time. We provi…