#include <grass/gis.h>

/*!
 * \brief Bresenham line algorithm
 *
 * Draws a line from <b>x1,y1</b> to <b>x2,y2</b>
 * using Bresenham's algorithm. A routine to plot points must be provided, as is
 * defined as:
 * point(x, y) plot a point at x,y
 * This routine does not require a previous call to <i>G_setup_plot</i> to 
 * function correctly, and is independent of all following routines.
 *
 *  \param x0
 *  \param y0
 *  \param x1
 *  \param y1
 *  \param point
 *  \return int
 */

int G_bresenham_line (
    register int x0, register int y0 ,
    int x1,int y1 ,
    int	(*point)())
{
    int dx, dy;
    int xinc, yinc;

    register int res1;
    int res2;

    xinc = 1;
    yinc = 1;
    if ((dx = x1-x0) < 0) 
    {
        xinc = -1;
        dx = -dx;
    }
    if ((dy = y1-y0) < 0) 
    {
        yinc = -1;
        dy = -dy;
    }
    res1 = 0;
    res2 = 0;

    if (dx > dy)
    {
        while (x0 != x1)
        {
            point (x0, y0);
            if (res1 > res2)
            {
                res2 += dx - res1;
                res1 = 0;
                y0 += yinc;
            }
            res1 += dy;
            x0 += xinc;
        }
    }
    else if (dx < dy)
    {
        while (y0 != y1)
        {
            point (x0, y0);
            if (res1 > res2)
            {
                res2 += dy - res1;
                res1 = 0;
                x0 += xinc;
            }
            res1 += dx;
            y0 += yinc;
        }
    }
    else
    {
        while (x0 != x1)
        {
            point (x0, y0);
            y0 += yinc;
            x0 += xinc;
        }
    }

    point (x1, y1);

    return 0;
}