一种基于立方体小栅格的K邻域快速搜索算法
A New K-Nearest Neighbors Search Algorithm Based on 3D Cell Grids
-
摘要: 提出了一种新的基于立方体小栅格的K邻域搜索算法。首先,采用二次划分的方法将点云划分到相应的立方体小栅格中;然后,为采样点所在的立方体小栅格确定最终子空间、内子空间和外子空间,结合采样点的球空间,就能很快确定该采样点的K邻域的搜索范围。与已有方法相比,该算法具有更高的搜索效率。Abstract: Based on 3D cell grids,we proposed a new K-nearest neighbors search algorithm.The point cloud was divided twice and distributed to 3D cell grids,then ultimate space,internal space,external space were decided for each grid.With the help of each point's sphere space,K-nearest neighbors of the point can be found quickly.Compared with the existed methods,the proposed algorithm has more efficient performance.
下载:
