扫描线填充算法--有效边表填充算法.docVIP

代码： draw.cpp //using OpenGL #include opengl.h #include iostream #include vector #include algorithm #include unistd.h #define PN 6 int point[N][2]={{40,5},{75,40},{60,70},{35,50},{25,80},{5,30}}; //AE struct AE{ AE(float _x,float _dx,int _ymax){x=_x;dx=_dx;ymax=_ymax;} float x; float dx; int ymax; void operator ++(int){ x+=dx; } }; //AET //which eage is on the right bool fill_comp(const AE ae1,const AE ae2){ if(ae1.xae2.x){ return true; } if(ae1.x==ae2.xae1.dxae2.dx){ return true; } return false; } void fillline(int y,int x1,int x2){ for(int i=x1;i=x2;i++) drawpoint(i,y); flush(); } void fill(){ //make k=(x2-x1)/(y2-y1) float k[PN]={0.0};for(int i=0;i!=PN;i++){k[i]=((float)(point[(i+1)%PN][0]-point[i][0])/(float)(point[(i+1)%PN][1]-point[i][1]));} //find min and max with selection sort. int min=point[0][1],max=min;for(int i=0;i!=PN;i++){if(point[i][1]max){max=point[i][1];};;if(point[i][1]min){max=point[i][1];}} //make scanning line list std::vectorAE *ET = new std::vectorAE[max-min+1]; //make ET // for (int i = 0; iPN; ++i){ //get ymin, ymax int yminn=point[i][1]point[(i+1)%PN][1] ? i : (i+1)%PN; int ymaxn=point[i][1]=point[(i+1)%PN][1] ? i : (i+1)%PN; AE *tmp = new AE(point[yminn][0],k[i],point[ymaxn][1]); //insert node ET[point[yminn][1]-min].push_back(*tmp); } //init AET std::vectorAE AET; for(int i=0;i!=max-min+1;i++){ //insert node from ET to AET for(int ii=0;ii!=ET[i].size();ii++){ //sort with selection sort. AET.insert(std::upper_bound(AET.begin(), AET.end(),ET[i][ii],fill_comp),ET[i][ii]); } //delete y=ymax,下闭上开 for(int ii=0;ii!=AET.size();){if(i+min==AET[ii].ymax) {AET.erase(AET.begin()+ii);}else{ii++;}} //draw { bool flag=false; for(int ii=0;ii!=AET