enginelong的博客

Kd_tree 的构建思路：循环沿着x、y、z轴的方向进行排序、切分、递归 point_indices_left_end_idx = math.ceil(len(point_indices_sorted) / 2) - 1 # 左半部分终止索引 point_sorted_middle_left = point_indices_sorted[point_indices_left_end_idx] # 左半部分末端值 point_indices_left_end_value = db[point_sor

PCA降维、法向量估计 # 实现PCA分析和法向量计算，并加载数据集中的文件进行验证 import open3d as o3d import os import numpy as np from pyntcloud import PyntCloud from pandas import DataFrame import matplotlib.pyplot as plt from mpl_toolkits.mplot3d import Axes3D # matplotlib显示点云函数 def Poin