边相关扫描线多边形填充算法

《边相关扫描线多边形填充算法》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、边相关扫描线多边形填充算法M文件代码：functionscanedge(X,Y)[s,sY]=size(Y);maxY=max(Y);minY=min(Y);%奇异点Y1=Y;if(Y(sY)>Y(1)&Y(2)

2、(Y(sY)Y(1))Y1(1)=Y(1)-1;endif(Y(sY-1)>Y(sY)&Y(1)

3、(Y(sY-1)Y(sY))Y1(sY)=Y(sY)-1;endfori=2:sY-1if(Y(i-1)>Y(i)&Y(i+1)

4、(Y(i-1)Y(i))Y1(i)=

5、Y(i)-1;endend%画出多边形holdon;plot([X(1),X(sY)],[Y(1),Y(sY)],'r');plot(X,Y,'r');axisequal;gridon;%建ET表Edge=zeros(sY);ET=cell(maxY,1);fori=minY:maxYA=find(Y==i);sA=size(A);k=1;forj=1:sA(2)%扫描到P1点时ifA(j)==1ifX(sY)

6、,k}=[max(Y1(sY),Y1(1)),X(1),...(X(1)-X(sY))/(Y(1)-Y(sY))];endk=k+1;endEdge(sY)=1;endifEdge(1)==0ifY(2)~=Y(1)ifX(2)==X(1)ET{i,k}=[max(Y1(2),Y1(1)),X(1),0];elseET{i,k}=[max(Y1(2),Y1(1)),X(1),...(Y(2)-Y(1))/(X(2)-X(1))];endk=k+1;endEdge(1)=1;endelseifEdge(1)==0ifY(2)~=Y(1)ifX(2)==X(1)ET{i,k}=[max

7、(Y1(2),Y1(1)),X(1),0];elseET{i,k}=[max(Y1(2),Y1(1)),X(1),...(Y(2)-Y(1))/(X(2)-X(1))];endk=k+1;endEdge(1)=1;endifEdge(sY)==0ifY(sY)~=Y(1)ifX(sY)==X(1)ET{i,k}=[max(Y1(sY),Y1(1)),X(1),0];elseET{i,k}=[max(Y1(sY),Y1(1)),X(1),...(Y(1)-Y(sY))/(X(1)-X(sY))];endk=k+1;endEdge(sY)=1;endendend%扫描到P1以外的点时i

8、fA(j)~=1X1=X;X1(sY+1)=X(1);ifX(A(j)-1)

9、sY+1)=Y(1);Y3=Y1;Y3(sY+1)=Y1(1);ifY2(A(j)+1)~=Y(A(j))ifX1(A(j)+1)==X(A(j))ET{i,k}=[max(Y3(A(j)+1),Y1(A(j))),X(A(j)),0];elseET{i,k}=[max(Y3(A(j)+1),Y1(A(j))),X(A(j)),...(X1(A(j)+1)-X(A(j)))/(Y2(A(j)+1)-Y(A(j)))];endk=k+1;endEdge(A(j))=1;endelseifEdge(A(j))==0Y2=Y;Y2(sY+1)=Y(1);ifY2(A(j)+1)~=Y(A

10、(j))ifX1(A(j)+1)==X(A(j))ET{i,k}=[max(Y1(A(j)+1),Y1(A(j))),X(A(j)),0];elseET{i,k}=[max(Y1(A(j)+1),Y1(A(j))),X(A(j)),...(X1(A(j)+1)-X(A(j)))/(Y2(A(j)+1)-Y2(A(j)))];endk=k+1;endEdge(A(j))=1;endifEdge(A(j)-1)==0ifY(A(j)-1)~=Y(A(j))ifX(A(j)