Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds (2008)
by
M. Connor
,
P. Kumar
| Citations: | 5 - 1 self |
BibTeX
@MISC{Connor08parallelconstruction,
author = {M. Connor and P. Kumar},
title = {Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds },
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
