This algorithm is used for scan converting a line. It was developed by Bresenham. It is an efficient method because it involves only integer addition, subtractions, and multiplication operations. These operations can be performed very rapidly so lines can be generated quickly. In this method, next pixel selected is that one who has the least distance from true line.

### The method works as follows:

Assume a pixel P1'(x1',y1'),then select subsequent pixels as we work our way to the night, one pixel position at a time in the horizontal direction toward P2'(x2',y2').

Once a pixel in choose at any step.

### The next pixel is

- Either the one to its right (lower-bound for the line)
- One top its right and up (upper-bound for the line). The line is best approximated by those pixels that fall the least distance from the path between P1',P2'.To chooses the next one between the bottom pixel S and top pixel T.
- If S is chosen

We have xi+1=xi+1 and yi+1=yi

If T is chosen

We have xi+1=xi+1 and yi+1=yi+1

The actual y coordinates of the line at **x = xi+1is y=mxi+1+b**

The distance from S to the actual line in y direction

** s = y-yi**

The distance from T to the actual line in y direction

** t = (yi+1)-y**

Now consider the difference between these 2 distance values

**s - t**

When (s-t) <0 ⟹ s < t

The closest pixel is S

When (s-t) ≥0 ⟹ s < t

The closest pixel is T

This difference is

**s-t = (y-yi)-[(yi+1)-y]**

**= 2y - 2yi**

**Bresenham's Line Algorithm**

**Step1: **Start Algorithm

**Step2: **Declare variable x1,x2,y1,y2,d,i1,i2,dx,dy

**Step3: **Enter value of x1,y1,x2,y2

Where x1,y1 are coordinates of starting point

And x2,y2 are coordinates of Ending point

**Step4: **Calculate dx = x2-x1

Calculate dy = y2-y1 Calculate i1=2*dy

Calculate i2=2*(dy-dx) Calculate d=i1-dx

**Step5: **Consider (x, y) as starting point and xendas maximum possible value of x.

If dx < 0

Then x = x2 y = y2 xend=x1

If dx > 0 Then x = x1

y = y1

xend=x2

**Step6: **Generate point at (x,y)coordinates.

**Step7: **Check if whole line is generated.

If x > = xend Stop.

**Step8: **Calculate co-ordinates of the next pixel If d < 0

Thend = d + i1

If d ≥ 0

Then d = d + i2 Increment y = y + 1

**Step9: **Increment x = x + 1

**Step10: **Draw a point of latest (x, y) coordinates

**Step11: **Go to step 7

**Step12: **End of Algorithm

**Example of ****Bresenham's Line Algorithm**

Starting and Ending position of the line are (1, 1) and (8, 5). Find intermediate points.

**Solution:**

** **x1=1

y1=1 x2=8 y2=5

dx= x2-x1=8-1=7 dy=y2-y1=5-1=4

I1=2* ∆y=2*4=8 I2=2*(∆y-∆x)=2*(4-7)=-6 d = I1-∆x=8-7=1

### Advantage of **Line Algorithm**

- It involves only integer arithmetic, so it is simple.
- It avoids the generation of duplicate points.
- It can be implemented using hardware because it does not use multiplication and division.
- It is faster as compared to DDA (Digital Differential Analyzer) because it does not involve floating point calculations like DDA Algorithm.

### Disadvantage of **Line Algorithm**

- This algorithm is meant for basic line drawing only Initializing is not a part of Bresenham's line algorithm. So to draw smooth lines, you should want to look into a different algorithm.