Fast construction of k-nearest neighbor graphs for point clouds

Fast construction of k-nearest neighbor graphs for point clouds

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) b...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 16(2010), 4 vom: 23. Juli, Seite 599-608
1. Verfasser: Connor, Michael (VerfasserIn)
Weitere Verfasser: Kumar, Piyush
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2010
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM198058756
003 DE-627
005 20231223211918.0
007 cr uuu---uuuuu
008 231223s2010 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2010.9  |2 doi 
028 5 2 |a pubmed24n0660.xml 
035 |a (DE-627)NLM198058756 
035 |a (NLM)20467058 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Connor, Michael  |e verfasserin  |4 aut 
245 1 0 |a Fast construction of k-nearest neighbor graphs for point clouds 
264 1 |c 2010 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 27.07.2010 
500 |a Date Revised 14.05.2010 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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-comparison-based parallel sort of points, according to Morton order plus near-linear additional steps to output the k-nearest neighbor graph 
650 4 |a Journal Article 
700 1 |a Kumar, Piyush  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 16(2010), 4 vom: 23. Juli, Seite 599-608  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:16  |g year:2010  |g number:4  |g day:23  |g month:07  |g pages:599-608 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2010.9  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 16  |j 2010  |e 4  |b 23  |c 07  |h 599-608