| dc.contributor.author | Connor, M. | en_US |
| dc.contributor.author | Kumar, P. | en_US |
| dc.contributor.editor | Hans-Christian Hege and David Laidlaw and Renato Pajarola and Oliver Staadt | en_US |
| dc.date.accessioned | 2014-01-29T17:14:32Z | |
| dc.date.available | 2014-01-29T17:14:32Z | |
| dc.date.issued | 2008 | en_US |
| dc.identifier.isbn | 978-3-905674-12-5 | en_US |
| dc.identifier.issn | 1727-8376 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/VG/VG-PBG08/025-031 | en_US |
| dc.description.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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: k-NN Graphs | en_US |
| dc.title | Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds | en_US |
| dc.description.seriesinformation | IEEE/ EG Symposium on Volume and Point-Based Graphics | en_US |
