CSDL Home IEEE Transactions on Visualization & Computer Graphics 2010 vol.16 Issue No.04 - July/August
Issue No.04 - July/August (2010 vol.16)
Michael Connor , Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
Piyush Kumar , Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.9
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.
Concurrent computing, Parallel algorithms, Multicore processing, Three-dimensional displays, Computer graphics, Visualization, Surface reconstruction, Algorithm design and analysis,parallel algorithms., Nearest neighbor searching, point-based graphics, k-nearest neighbor graphics, Morton ordering
Michael Connor, Piyush Kumar, "Fast construction of k-nearest neighbor graphs for point clouds", IEEE Transactions on Visualization & Computer Graphics, vol.16, no. 4, pp. 599-608, July/August 2010, doi:10.1109/TVCG.2010.9