2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CG2008★ 2 cited
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
Herman Haverkort, Freek van Walderveen
Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling c…
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…