FRESH: Fréchet Similarity with Hashing

Matteo Ceccarello and Anne Driemel and Francesco Silvestri
2019 arXiv   pre-print
This paper studies the r-range search problem for curves under the continuous Fréchet distance: given a dataset S of n polygonal curves and a threshold r>0, construct a data structure that, for any query curve q, efficiently returns all entries in S with distance at most r from q. We propose FRESH, an approximate and randomized approach for r-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning
more » ... step based on a cascade of curve simplifications. We experimentally compare to exact and deterministic solutions, and we show that high performance can be reached by suitably relaxing precision and recall.
arXiv:1809.02350v3 fatcat:ciwiaam4inf2ndd2ryjybjnjpq