Bresenham’s Line Algorithm

1. Input two line endpoints (x₁, y₁) and (x₂, y₂)
2. Calculate constants:
Δx=x₂ – x₁
Δy=y₂ – y₁
2Δy
2Δy-Δx
3. Assign value to the starting parameter :
k=0
P₀=2Δy-Δx
4. Plot the pixel at (x₁, y₁)
5. For each integer X Co-ordinate, X_k along the line.
if P_k<0, the next point to plot is (x_k+1, y_k)
P_k+1=P_k+2Δy
else
the next point to plot is (x_k+1, y_k+1)
P_k+1=P_k+2Δy-2Δx
6. Repeat Step 5 Δx lines.