6 | de Bresenham algorithm | void Bresenham (int x0, y0, x1, y1) { | | | | int dx = x1 - x0; | int dy = y1 - y0; |
int x = x0; | | int y = y0; | | int d0 = 2 * dy-dx; |
int de = 2 * dy;
| | int DNE = 2 * (dy-dx); | int d = d0; | | int m = ( dy / dx) +1;
| | while (x! = x1) | | |
{if (d
| | if (m | point (x, y) = x | | xm;
| d = d + de; | | | else {point (x, y); |
x = x + m;
d = d + de;}
else {
point (x, y);
x = xm;
y = y + m;
d = d + dne; } else
{(x, y); x = x + m; y = y + m; d = d + dne; }}
0 comments:
Post a Comment