33 citations · 73 across the 19 of their papers we have counts for
23 papers
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface
Annika Bonerath, Anne Driemel, Jan-Henrik Haunert +3
In this paper, we analyze the approximation quality of a greedy heuristic for automatic map labeling. As input, we have a set of events, each associated with a label at a fixed pos…
The limit of Voronoi diagrams as is the bounding-box-area Voronoi diagram
Herman Haverkort, Rolf Klein
We consider the Voronoi diagram of points in the real plane when the distance between two points and is given by where We pro…
Minimum-Error Triangulations for Sea Surface Reconstruction
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert +6
We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by…
Hyperbolae are the locus of constant angle difference
Herman Haverkort, Rolf Klein
Given two points A,B in the plane, the locus of all points P for which the angles at A and B in the triangle A,B,P have a constant sum is a circular arc, by Thales' theorem. We sho…
Plane-filling trails
Herman Haverkort
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality:…
Shortest-Path-Preserving Rounding
Herman Haverkort, David Kübel, Elmar Langetepe
Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visua…