
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
We study the capproximate near neighbor problem under the continuous Fr...
read it

Enumeration of FarApart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
Hyperbolicity is a graph parameter which indicates how much the shortest...
read it

Translating Hausdorff is Hard: FineGrained Lower Bounds for Hausdorff Distance Under Translation
Computing the similarity of two point sets is a ubiquitous task in medic...
read it

(k, l)Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
Due to the massively increasing amount of available geospatial data and ...
read it

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
Consider the natural question of how to measure the similarity of curves...
read it

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
The Fréchet distance provides a natural and intuitive measure for the po...
read it

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
The discrete Fréchet distance is a popular measure for comparing polygon...
read it
André Nusser
is this you? claim profile