Parallel construction of k-nearest neighbor graphs for point clouds

Authors:
M. Connor;P. Kumar
Affiliations:
Department of Computer Science, Florida State University;Department of Computer Science, Florida State University
Venue:
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
Year:
2008

Citing 15
Cited 2

An O(n log n) algorithm for the all-nearest-neighbors problem

Discrete & Computational Geometry
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Algorithms for proximity problems in higher dimensions

Computational Geometry: Theory and Applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Point set surfaces

Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces

Proceedings of the conference on Visualization '02
Estimating surface normals in noisy point cloud data

Proceedings of the nineteenth annual symposium on Computational geometry
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Shape modeling with point-sampled geometry

ACM SIGGRAPH 2003 Papers
Robust Watermarking of Point-Sampled Geometry

SMI '04 Proceedings of the Shape Modeling International 2004
Robust moving least-squares fitting with sharp features

ACM SIGGRAPH 2005 Papers
A fast all nearest neighbor algorithm for applications involving large point-clouds

Computers and Graphics
Valgrind: a framework for heavyweight dynamic binary instrumentation

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Fast algorithms for the all nearest neighbors problem

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Finite elements on point based surfaces

SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics

Geometric minimum spanning trees with GEOFILTERKRUSKAL*

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Efficient parallel kNN joins for large data in MapReduce

Proceedings of the 15th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

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.