Distributed computation of the \textit{k}nn graph for large high-dimensional point sets

DOI10.1016/j.jpdc.2006.10.004zbMath1112.68121DBLPjournals/jpdc/PlakuK07OpenAlexW2157057296WikidataQ42210805 ScholiaQ42210805MaRDI QIDQ869400

Lydia E. Kavraki, Erion Plaku

Publication date: 2 March 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.10.004

zbMATH Keywords

metric spacesroboticsdistributed algorithmsnearest neighborsrange queries\textit{k}nn graphsapproximate nearest neighbors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (1)

Unnamed Item

This page was built for publication: Distributed computation of the \textit{k}nn graph for large high-dimensional point sets