Fast construction of k-nearest neighbor graphs for point clouds
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) b...
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1998. - 16(2010), 4 vom: 23. Juli, Seite 599-608 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2010
|
| Accès à la collection: | IEEE transactions on visualization and computer graphics |
| Sujets: | Journal Article |
| Résumé: | 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 |
|---|---|
| Description: | Date Completed 27.07.2010 Date Revised 14.05.2010 published: Print Citation Status MEDLINE |
| ISSN: | 1941-0506 |
| DOI: | 10.1109/TVCG.2010.9 |