clear all;
data = importdata('圆柱.txt');
xx = data(:,1); yy = data(:,2); zz = data(:,3);
[sx,idx] = sort(xx); [sz,idz] = sort(zz);
%% view(2) 对x 在[40,90],z为任意值,搜索y的最大最小值,构成直线x-y关系
Xst = 40; Xed = 90; Xstep = 1;% 起点,终点,步长
n = 50;xylx = zeros(n,1);xyly = zeros(n,1);
lsytx = yy(idx);%循环找出y的最小值构成的边界
for k = 1:1:n
xylx(k) = Xst + (k-0.5)*Xstep;
ct = [];
for i =1:1:length(sx)
if sx(i) > Xst + (k-2)*Xstep && sx(i) < Xst + k*Xstep
ct = [ct;i];
else
continue;
end
end
xyly(k) = min(lsytx(ct));
end
xyux = zeros(n,1);xyuy = zeros(n,1);
usytx = yy(idx);%循环找出y的最大值构成的边界
for k = 1:1:n
xyux(k) = Xst + (k-0.5)*Xstep;
ct =