直线的生成算法

void DDALine(int x0,int y0,int xi,int yi,int color)
{
int i;
float dx,dy,length,x,y;
if(fabs(xi-x0)>=fabs(yi-y0))
length=fabs(xi-x0);
else
length=fabs(yi-y0);
dx=(xi-x0)/length;
dy=(yi-y0)/length;
i=1;
x=x0;
y=y0;
while(i<=length)
{
SetPixel(int(x+0.5),int(y+0.5),color);
x=x+dx;
y=y+dy;
i++;
}
}
//DDA数值微分法,取整和浮点运算太多，效率不高


void Bresenham_Line(int x0,int y0,int xi,int yi,int color)
{
int dx,dy,e,i,x,y;
dx=xi-x0;
dy=yi-y0;
e=2*dy-dx;
x=x0;
y=y0;
for(i=0;i<=dx;i++)
{
SetPixel(x,y,color);
x++;
if(e>=0)
{
y++;
e=e+2*dy-2*dx;
}
else
e=e+2*dy；
}
}
//Bresenham法，目前最为常用

void lcd_draw_line(LCD *lcd, int x0, int y0, int x1, int y1, int color)

{

 

    int dx = abs(x1 - x0);

    int dy = abs(y1 - y0);

    int x = x0;

    int y = y0;

    int stepX = 1;

    int stepY = 1;

    if (x0 > x1) //从右向左画

        stepX = -1;

    if (y0 > y1)

        stepY = -1;

 

    if (dx > dy) //沿着最长的那个轴前进

    {

        int e = dy * 2 - dx;

        for (int i = 0; i <= dx; i++)

        {

            lcd_draw_point(lcd, x, y, color);

            x += stepX;

            e += dy;

            if (e >= 0)

            {

                y += stepY;

                e -= dx;

            }

        }

    }

    else

    {

        int e = 2 * dx - dy;

        for (int i = 0; i <= dy; i++)

        {

            lcd_draw_point(lcd, x, y, color);

            y += stepY;

            e += dx;

            if (e >= 0)

            {

                x += stepX;

                e -= dy;

            }

        }

    }

}