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...
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 16(2010), 4 vom: 23. Juli, Seite 599-608 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2010
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics |
| Schlagworte: | Journal Article |
| Online verfügbar |
Volltext |