Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds

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… (More)
DOI: 10.2312/VG/VG-PBG08/025-031

Topics

11 Figures and Tables

Cite this paper

@inproceedings{Connor2008ParallelCO, title={Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds}, author={M. Connor and P. Kumar}, booktitle={Volume Graphics}, year={2008} }