Eurographics Digital Library now runs dspace7. Some settings need to be completed in the next few days. Please report any problems to eg-support@eg.org. (The old server is still available at https://dlold.eg.org/ )
VG-PBG08: Eurographics/IEEE VGTC on Volume and Point-Based Graphics
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"
(The Eurographics Association, 2008) Connor, M.; Kumar, P.; Hans-Christian Hege and David Laidlaw and Renato Pajarola and Oliver Staadt
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.