35 citations · 91 across the 28 of their papers we have counts for
6 papers · 1 filter
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…
Pattern matching under DTW distance
Garance Gourdel, Anne Driemel, Pierre Peterlongo +1
In this work, we consider the problem of pattern matching under the dynamic time warping (DTW) distance motivated by potential applications in the analysis of biological data produ…
Faster Approximate Covering of Subcurves under the Fréchet Distance
Frederik Brüning, Jacobus Conradi, Anne Driemel
Subtrajectory clustering is an important variant of the trajectory clustering problem, where the start and endpoints of trajectory patterns within the collected trajectory data are…
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…
On Computing the -Shortcut Fréchet Distance
Jacobus Conradi, Anne Driemel
The Fréchet distance is a popular measure of dissimilarity for polygonal curves. It is defined as a min-max formulation that considers all direction-preserving continuous bijection…
On the Discrete Fréchet Distance in a Graph
Anne Driemel, Ivor van der Hoog, Eva Rotenberg
The Fréchet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and…