编码法判断点与多边形位置关系.docxVIP

//函数返回 1-内 2-外 3-边界上//判断每个点的象限对应的数字int area(double x, double y){inti;if(x=0y0)i=0;else if(x0y=0)i=1;else if(x=0y0)i=2;else if(x0y=0)i=3;returni;}//奇异情况——即跨越两个象限时的拆分处理int change(double x1, double y1, double x2, double y2){int m1,n1,m2,n2;//计算象限对应的数字int minus1,minus2;//拆分后两组差值doublemidx=(x1+x2)/2;double midy=(y1+y2)/2;//中点坐标m1=area(x1,y1);n1=area(midx,midy);m2=area(midx,midy);n2=area(x2,y2);minus1=n1-m1;minus2=n2-m2;if(minus1==3)minus1=-1;else if(minus1==-3)minus1=1;if(minus2==3)minus2=-1;else if(minus2==-3)minus2=1;//判断拆分后是否跨越两个象限，若是，迭代继续拆分if((minus1!=2minus1!=-2)(minus2!=2minus2!=-2))return minus1+minus2;else if((minus1==2||minus1==-2)(minus2!=2minus2!=-2))return change(x1,y1,midx,midy)+minus2;else if((minus1!=2minus1!=-2)(minus2==2||minus2==-2))return minus1+change(midx,midy,x2,y2);else if((minus1==2||minus1==-2)(minus2==2||minus2==-2))return change(x1,y1,midx,midy)+change(midx,midy,x2,y2);}//编码法判断是否点在图形内，在内部返回1，否则返回0boolIsPtInRegion(double x, double y){inti,m,n,sum=0;//i循环次数，m起点所在象限对应数字，n终点所在象限对应数字，sum差值之和double x1,y1,x2,y2;//起点终点int minus;//象限差值double x0;//交点坐标for(i=0;i=num-1;i++){//在待定点坐标系下，为两端点坐标赋值if(i!=num-1){x1=ptList[i].x-x;y1=ptList[i].y-y;x2=ptList[i+1].x-x;y2=ptList[i+1].y-y;}else{x1=ptList[num-1].x-x;y1=ptList[num-1].y-y;x2=ptList[0].x-x;y2=ptList[0].y-y;}//排除端点重合if((x==x1y==y1)||(x==x2y==y2))return 0;//排除在直线上x0=(x2-x1)*1.0/(y2-y1)*1.0*(y-y1)+x1;if(x0==double(x))return 0;//计算两点象限差值m=area(x1,y2);n=area(x2,y2);minus=n-m;//第一类奇异情况if(minus==3)minus=-1;else if(minus==-3)minus=1;//第二类奇异情况if(minus==2||minus==-2)minus=change(x1,y1,x2,y2);sum+=minus;}if(sum==0)return 0;if(sum==4||sum==-4)return 1;}