2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CG2010★ 2 cited
Farthest-Polygon Voronoi Diagrams
Otfried Cheong, Hazel Everett, Marc Glisse +5
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distan…
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
The Hadwiger Number of Jordan Regions is Unbounded
Otfried Cheong, Mira Lee
We show that for every n > 0 there is a planar topological disk A_0 and n translates A_1, A_2, ..., A_n of A_0 such that the interiors of A_0, ... A_n are pairwise disjoint, but wi…