📄 mykdtree.asv
字号:
function leaf = kdtree(pointsets,level,treeleft,treeright)
if isempty(pointsets)
return;
end
n_points = size(pointsets);
n_points = n_points(2);
points1 = [];
points2 = [];
if le
if n_points == 1
leaf = pointsets;
return;
else
if mod(level,2) == 0
meanvaluex = mean(pointsets(1,:));
for i=1:n_points
if pointsets(1,i) <= meanvaluex
points1 = [points1 pointsets(:,i)];
else
points2 = [points2 pointsets(:,i)];
end
end
else
meanvaluey = mean(pointsets(2,:));
for i=1:n_points
if pointsets(2,i) >= meanvaluey
points1 = [points1 pointsets(:,i)];
else
points2 = [points2 pointsets(:,i)];
end
end
end
leafleft = [treeleft mykdtree(points1, level+1)];
leafright = [treeright mykdtree(points2, level+1)];
end
treeleft = [treeleft leafleft];
treeright = [treeright leafright];
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -