kd-trees meaning in Chinese
线段树
Examples
- Secondly , as the most computation time of the icp is spent in the closest point search step , it is necessary to speed up the search process , so a fast algorithm for search the points based on kd - tree ( k = 3 ) is introduced , which allows a point to find its closest point in the time cost of o ( log 2n )
其次是迭代过程中的匹配搜索,由于icp算法主要的时间花费在匹配搜索上,有必要加速搜索的过程,采用基于kd ( k = 3 )树的快速搜索算法,可在o ( log2n )的时间内查找到最近邻的边缘点。