35 citations · 91 across the 28 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
FRESH: Fréchet Similarity with Hashing
Matteo Ceccarello, Anne Driemel, Francesco Silvestri
This paper studies the -range search problem for curves under the continuous Fréchet distance: given a dataset of polygonal curves and a threshold , construct a dat…
cs.CG2018★ 2 cited
Probabilistic embeddings of the Fréchet distance
Anne Driemel, Amer Krivošija
The Fréchet distance is a popular distance measure for curves which naturally lends itself to fundamental computational tasks, such as clustering, nearest-neighbor searching, and s…
cs.CG2018
Approximating -center clustering for curves
Kevin Buchin, Anne Driemel, Joachim Gudmundsson +4
The Euclidean -center problem is a classical problem that has been extensively studied in computer science. Given a set of points in Euclidean space, the probl…