Fast construction of k-nearest neighbor graphs for point clouds

@article{Connor2010FastCO,
  title={Fast construction of k-nearest neighbor graphs for point clouds},
  author={Michael Connor and Piyush Kumar},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  year={2010},
  volume={16},
  pages={599-608}
}
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) better cache efficiency, 4) ability to handle large data sets, and 5) ease of parallelization and implementation. If the point set has a bounded expansion constant, our algorithm requires one… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

99 Citations

01020'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

ANN: Library for Approximate

  • D. Mount
  • Nearest Neighbor Searching,
  • 1998
Highly Influential
11 Excerpts

Manuscript: A minimalist’s implementation of an approximate nearest neighbor algorithm in fixed dimensions

  • T. M. Chan
  • 2006
3 Excerpts

Similar Papers

Loading similar papers…