Bresenham’s Line Algorithm

1. Input two line endpoints (x1, y1) and (x2, y2)
2. Calculate constants:
Δx=x2 – x1
Δy=y2 – y1
2Δy
2Δy-Δx
3. Assign value to the starting parameter :
k=0
P0=2Δy-Δx
4. Plot the pixel at (x1, y1)
5. For each integer X Co-ordinate, Xk along the line.
if Pk<0, the next point to plot is (xk+1, yk)
Pk+1=Pk+2Δy
else
the next point to plot is (xk+1, yk+1)
Pk+1=Pk+2Δy-2Δx
6. Repeat Step 5 Δx lines.