# Bresenham Line Drawing Algorithm Solved Example

### Bresenham Line Drawing Algorithm Solved Example

We have three most popular line drawing algorithms in computer graphics.

1. DDA Line Drawing Algorithm

2. Bresenham Line Drawing Algorithm

3. Mid Point Line Drawing Algorithm

In this tutorial we will disscuss the Bresenham line algorithm and also, solve a numarical example using Bresenham algorithm.

### Bresenham Algorithm

Bresenham Line Drawing Algorithm is one of the simplest and most powerful line drawing algorithm in computer graphics. This algorithm overcomes the disadvantages of DDA algorithm.

Given –

Starting coordinates = (X0, Y0)

Ending coordinates = (Xn, Yn)

A four-step approach is followed to generate the line.

Step 1:

Calculate parameters ΔX, ΔY and M from the given input.

These parameters are calculated as –

ΔX = Xn – X0

ΔY =Yn – Y0

Step 2:

Calculate the decision parameter Pk.

It is calculated as – Pk = 2ΔY – ΔX

This decision variable is used to dicide, whether x coordinate should be incremented or y coordinate should be increamented or both.

Step 3:

Suppose the current point is (Xk, Yk) and the next point is (Xk+1, Yk+1).

Find the next point by following the below three cases –

Case 1: if (Pk<0)

Xk+1= Xk + 1

Yk+1= Yk

Pk+1 = Pk + 2ΔY

Case 2: if (Pk >= 0)

Xk+1= Xk + 1

Yk+1= Yk + 1

Pk+1 = Pk + 2ΔY – 2ΔX

Step 4:

Pk+1 will become the decision parameter for the next iteration. (Xk+1, Yk+1) is the (Xk+1, Yk+1) in the next iteration. Keep repeating Step-03 until the endpoint is reached or the number of iterations equals to (ΔX-1) times.

## 3. Solved Example DDA Algorithm

Bresenham Line Drawing Algorithm Solved Example: If you like the material share it with your friends. Like the Facebook page for regular updates and YouTube channel for video tutorials.