KD-tree:切分规则、回溯剪枝与维度增长下的失效边界 2026-05-28 | algorithms | #kd-tree #nearest-neighbor #range-search #spatial-index #curse-of-dimensionality #sliding-midpoint #scipy #nanoflann #flann 用分步图讲 kd-tree 构建、回溯剪枝和 √n 范围查询,核对主流库实现,并用可复现实验说明维度增长、内在维度与近似搜索的边界。