Algorithm for finding k-nearest neighbors based on octree segmentation in space
暂无分享,去创建一个
An octree based on the rapid k nearest search was presented for scattered points from 3D scanner. Through the establishment of bounding box on point sets, octree was used to record segmentation process, so that the search of point neighbors was limited to the bounding box of sample points and its neighbor, and through pruning strategies to further narrow the scope of the search.The experiments on a great deal of real data show that the search speed can be well improved.