5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.CG2007★ 1 cited
Computing a Minimum-Dilation Spanning Tree is NP-hard
Otfried Cheong, Herman Haverkort, Mira Lee
In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum fac…
cs.CG2007★ 5 cited
Hadwiger and Helly-type theorems for disjoint unit spheres
Otfried Cheong, Xavier Goaoc, Andreas Holmsen +1
We prove Helly-type theorems for line transversals to disjoint unit balls in . In particular, we show that a family of disjoint unit balls in has a line…