Approximate nearest neighbor algorithms for Frechet distance via product metrics

DOI10.1145/513400.513414zbMath1414.68127OpenAlexW2064671795MaRDI QIDQ4557543

Piotr Indyk

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513414

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

ANN for time series under the Fréchet distance ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance ⋮ Unnamed Item ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ Index structures for fast similarity search for symbol strings ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ Unnamed Item

This page was built for publication: Approximate nearest neighbor algorithms for Frechet distance via product metrics