## Fast construction of k-Nearest Neighbor Graphs for Point Clouds

Citations: | 10 - 1 self |

### BibTeX

@MISC{Connor_fastconstruction,

author = {Michael Connor and Piyush Kumar},

title = {Fast construction of k-Nearest Neighbor Graphs for Point Clouds},

year = {}

}

### OpenURL

### Abstract

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. 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. Index Terms—Nearest neighbor searching, point based graphics, k-nearest neighbor graphics, Morton Ordering, parallel algorithms. 1