三维点云学习（2）五种算法比较 代码参考来自 黎老师github 本次测试包含五种算法比较： octree print("octree --------------") #时间统计 construction_time_sum = 0 knn_time_sum = 0 radius_time_sum = 0 brute_time_sum = 0 # #construction begin_t = time.time() root = octree.octree_construction(db_np, leaf_siz…

三维点云学习（2）五种算法比较 代码参考来自 黎老师github 本次测试包含五种算法比较： octree print("octree --------------") #时间统计 construction_time_sum = 0 knn_time_sum = 0 radius_time_sum = 0 brute_time_sum = 0 # #construction begin_t = time.time() root = octree.octree_construction(db_np, leaf_siz…

三维点云学习（2）中-Kd-tree (k-dimensional tree) kd-tree 实现 代码来自黎老师github 三维kd-tree 的图示 如下图所示，为三维kd-tree的切割图，进行三个维度的切割，kd-tree的本质就是对三个维度的数据点不断构建平衡二叉树。 运行结果 axis 1, split value: leaf, point_indices: [24, 43, 48, 39] axis 1, split value: leaf, point_indices: [10, 22, 37,…

三维点云学习（2）中-Kd-tree (k-dimensional tree) kd-tree 实现 代码来自黎老师github 三维kd-tree 的图示 如下图所示，为三维kd-tree的切割图，进行三个维度的切割，kd-tree的本质就是对三个维度的数据点不断构建平衡二叉树。 运行结果 axis 1, split value: leaf, point_indices: [24, 43, 48, 39] axis 1, split value: leaf, point_indices: [10, 22, 37,…