35 citations · 51 across the 4 of their papers we have counts for
16 papers
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…
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
Karl Bringmann, Anne Driemel, André Nusser +1
We study the -approximate near neighbor problem under the continuous Fréchet distance: Given a set of polygonal curves with vertices, a radius , and a parameter $k…
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
Lutz Oettershagen, Anne Driemel, Petra Mutzel
We study the problem of finding the most similar trajectories to a given query trajectory. Our work is inspired by the work of Grossi et al. [6] that considers trajectories as…
Approximating -Median Clustering for Polygonal Curves
Maike Buchin, Anne Driemel, Dennis Rohde
In 2015, Driemel, Krivošija and Sohler introduced the -median problem for clustering polygonal curves under the Fréchet distance. Given a set of input curves, the problem…