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 multicore machines, 2) less space usage, 3) better cache efficiency, 4) ability to handle large data sets, and 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.
Connor
Michael
M
Department of Computer Science, Florida State University, Tallahassee, FL 32306, USA. miconnor@cs.fsu.edu
Kumar
Piyush
P
D000465:Algorithms; D003196:Computer Graphics; D003198:Computer Simulation; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008962:Models, Theoretical; D014584:User-Computer Interface