Approximate nearest neighbor for curves: simple, efficient, and deterministic

DOI10.1007/s00453-022-01080-1OpenAlexW2931805178MaRDI QIDQ2701391

Omrit Filtser, Arnold Filtser, Matthew J. Katz

Publication date: 28 April 2023

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

dynamic time warpingpolygonal curvesFréchet distancenearest neighbor search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ANN for time series under the Fréchet distance
• Fast Fréchet queries
• Faster retrieval with a two-pass dynamic-time-warping lower bound
• Efficient nearest-neighbor query and clustering of planar curves
• Linear Programming in Linear Time When the Dimension Is Fixed
• Approximate nearest neighbor algorithms for Frechet distance via product metrics
• Cuckoo hashing
• Algorithms for the discrete Fréchet distance under translation
• Approximating (k, ℓ)-center clustering for curves
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• Approximating length-restricted means under dynamic time warping

This page was built for publication: Approximate nearest neighbor for curves: simple, efficient, and deterministic