# 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},
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

#### References

SHOWING 1-10 OF 41 REFERENCES
Approximating (k, 𝓁)-center clustering for curves
• Computer Science, Mathematics
• SODA
• 2019
• 16
• PDF
On the complexity of range searching among curves
• Computer Science, Mathematics
• SODA
• 2018
• 17
• PDF
Products of Euclidean metrics and applications to proximity questions among curves
• Computer Science, Mathematics
• Symposium on Computational Geometry
• 2018
• 14
• PDF
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Computer Science, Mathematics
• SIAM J. Comput.
• 2012
• 59
• PDF
Locality-Sensitive Hashing of Curves
• Mathematics, Computer Science
• Symposium on Computational Geometry
• 2017
• 42
• PDF