On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions

DOI10.1016/j.ipl.2023.106405zbMath1529.68313OpenAlexW4372235562MaRDI QIDQ6072195

Majid Mirzanezhad

Publication date: 12 October 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106405

zbMATH Keywords

approximation algorithmFréchet distancenearest neighbor searchdata structure

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Fréchet distance for realistic curves in near linear time
• ANN for time series under the Fréchet distance
• Fast Fréchet queries
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• A new algorithm for optimal 2-constraint satisfaction and its implications
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Approximate nearest neighbor algorithms for Frechet distance via product metrics
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Locality-sensitive hashing scheme based on p-stable distributions
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts

This page was built for publication: On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions