Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existing methods: (1) Faster construction of k-nearest neighbor graphs in practice on multi-core machines. (2) Less space usage. (3) Better cache efficiency. (4) Ability to handle large data sets. (5) Ease of parallelization and implementation. If the point set has a bounded expansion constant, our algorithm requires one comparison based parallel sort of points according to Morton order plus near linear additional steps to output the k-nearest neighbor graph.

• Type: Journal
• Year: 2010
• Where: TVCG
• Authors: Michael Connor, Piyush Kumar
• Keywords: Better Cache Efficiency, K-nearest Neighbor Graph, Neighbor Graph Construction, TVCG 2010