Efficient nearest-neighbor query and clustering of planar curves

DOI10.1007/978-3-030-24766-9_3OpenAlexW2965195388MaRDI QIDQ2285081

Omrit Filtser, Khadijeh Sheikhan, Boris Aronov, Matthew J. Katz, Michael Horton

Publication date: 16 January 2020

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

zbMATH Keywords

clusteringdata structurespolygonal curvesFréchet distance(approximation) algorithmsnearest-neighbor queries

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (2)

ANN for time series under the Fréchet distance ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic

This page was built for publication: Efficient nearest-neighbor query and clustering of planar curves