计算机图形学(直线的扫描转换I).ppt

while(x x1) { if ( d 0) x++; y += step; d += dt2; else x++; d += dt1; DrawPixel(x, y, color); } //End of while } else{ //y方向长，|斜率|1 if (y0 y1){ x=x0;x0=x1;x1=x; y=y0;y0=y1;y1=y; } a = x0 - x1; b = y1 - y0; if (a 0) a = -a; step = -1; else step =1; 完整的中点法算法描述 * d = (a1) + b; //判别式的初始值 dt1 = a 1; //d0时的判别式增量 dt2 = (a + b) 1; //d≤0时的判别式增量 x=x0;y=y0; DrawPixel(x,y,color); //画起点 while(y y1) { if ( d 0) y++; x += step; d += dt2; else y++; d += dt1; DrawPi