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. - 1996. - 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 |
| Accès en ligne |
Volltext |