What is bresanham algorithm?

Answer 1

If you're wondering about the "Bresenham line algorithm", it is an algorithm (a process used for making a desired result) that plots a geometrical line (consiting of infinate points, as if you draw a straight line on a piece of paper) and translates it to a computer screen (composed of pixels, or video "points" that have a specific amount of sized points) The algorithm is as follows: function line(x0, x1, y0, y1)

boolean steep := abs(y1 - y0) > abs(x1 - x0)

if steep then

swap(x0, y0)

swap(x1, y1)

if x0 > x1 then

swap(x0, x1)

swap(y0, y1)

int deltax := x1 - x0

int deltay := abs(y1 - y0)

int error := -(deltax + 1) / 2

int ystep

int y := y0

if y0 < y1 then ystep := 1 else ystep := -1

for x from x0 to x1

if steep then plot(y,x) else plot(x,y)

error := error + deltay

if error ≥ 0 then

y := y + ystep

error := error - deltax This algorithm was taken from the site http://en.wikipedia.org/wiki/Bresenham's_line_algorithm