Distributed computation of the knn graph for large high-dimensional point sets

High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor ( knn) graphs. The knn graph of a data set is obtained by connecting each point to its k closest points. As the research in the a...

Ausführliche Beschreibung