Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic
- 14 December 2022
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 85 (5) , 1490-1519
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Israel Science Foundation (1042/22, IP-2019-04-6268)
This publication has 19 references indexed in Scilit:
- Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails2014
- Fast Fréchet queriesComputational Geometry, 2013
- Jaywalking Your Dog: Computing the Fréchet Distance with ShortcutsSIAM Journal on Computing, 2013
- Approximate Nearest Neighbor Search for Low Dimensional Queries2011
- Faster retrieval with a two-pass dynamic-time-warping lower boundPattern Recognition, 2009
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance2008
- Cuckoo hashingJournal of Algorithms, 2004
- Approximate minimum enclosing balls in high dimensions using core-setsACM Journal of Experimental Algorithmics, 2003
- Approximate nearest neighbor algorithms for Frechet distance via product metrics2002
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984