Search
Now showing items 1-1 of 1
Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds
(The Eurographics Association, 2008)
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 ...