FRESH: Fréchet similarity with hashing

DOI10.1007/978-3-030-24766-9_19MaRDI QIDQ2285095zbMATH OpenOpenAlexFDO

Authors Matteo Ceccarello, Anne Driemel, Francesco Silvestri

Publication date 16 January 2020

Full work available at URL https://arxiv.org/abs/1809.02350

zbMATH Keywords

algorithm engineeringFréchet distancelocality sensitive hashingrange reportingsimilarity search

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• Locality-sensitive hashing of curves
• On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
• On the complexity of range searching among curves
• Fréchet Distance for Curves, Revisited
• Probabilistic embeddings of the Fréchet distance

Cited in

(6)

• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
• The Prefix Fréchet Similarity
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
• On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
• Locality sensitive hashing for efficient similar polygon retrieval

This page was built for publication: FRESH: Fréchet similarity with hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285095)