Approximate nearest neighbor algorithms for Frechet distance via product metrics
From MaRDI portal
Publication:4557543
DOI10.1145/513400.513414zbMath1414.68127MaRDI QIDQ4557543
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
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, Unnamed Item, Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions, ANN for time series under the Fréchet distance, Index structures for fast similarity search for symbol strings, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, Approximate nearest neighbor for curves: simple, efficient, and deterministic, Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance