Efficient Nearest-Neighbor Query and Clustering of Planar Curves

@inproceedings{Aronov2019EfficientNQ,
  title={Efficient Nearest-Neighbor Query and Clustering of Planar Curves},
  author={B. Aronov and O. Filtser and M. Horton and M. J. Katz and Khadijeh Sheikhan},
  booktitle={WADS},
  year={2019}
}
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal is to construct a compact data structure over $\mathcal{C}$, such that, given a query curve $Q$, one can efficiently find the curve in $\mathcal{C}$ closest to $Q$. In the center problem, the goal is to find a curve $Q$, such that the maximum distance… Expand
2 Citations
$(2+\epsilon)$-ANN for time series under the Fr\'echet distance
  • PDF

References

SHOWING 1-10 OF 41 REFERENCES
On the complexity of range searching among curves
  • 17
  • PDF
Products of Euclidean metrics and applications to proximity questions among curves
  • 14
  • PDF
High-Dimensional Computational Geometry
  • 116
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
  • 59
  • PDF
Approximate nearest neighbor algorithms for Frechet distance via product metrics
  • P. Indyk
  • Mathematics, Computer Science
  • SCG '02
  • 2002
  • 78
Locality-Sensitive Hashing of Curves
  • 42
  • PDF
...
1
2
3
4
5
...