Browsing VG-PBG08: Eurographics/IEEE VGTC on Volume and Point-Based Graphics by Subject "Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: k-NN Graphs"
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 ...