Massively parallel KD-tree construction and nearest neighbor search algorithms
暂无分享,去创建一个
[1] Matthijs C. Dorst. Distinctive Image Features from Scale-Invariant Keypoints , 2011 .
[2] Radu Bogdan Rusu,et al. 3D is here: Point Cloud Library (PCL) , 2011, 2011 IEEE International Conference on Robotics and Automation.
[3] Federico Tombari,et al. Unique Signatures of Histograms for Local Surface Description , 2010, ECCV.
[4] Andreas Nüchter,et al. GPU-Accelerated Nearest Neighbor Search for 3D Registration , 2009, ICVS.
[5] Krzysztof Boryczko,et al. GPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search , 2008, J. WSCG.
[6] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[7] Kun Zhou,et al. Real-time KD-tree construction on graphics hardware , 2008, SIGGRAPH 2008.
[8] Michel Barlaud,et al. Fast k nearest neighbor search using GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.