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:

4.5M

480

Exception Handling in Java - Javatpoint

Assume a pixel P₁'(x₁',y₁'),then select subsequent pixels as we work our may to the night, one pixel position at a time in the horizontal direction toward P₂'(x₂',y₂').

Once a pixel in choose at any step

The next pixel is

1. Either the one to its right (lower-bound for the line)
2. 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 P₁',P₂'.

To chooses the next one between the bottom pixel S and top pixel T.
            If S is chosen
            We have x_i+1=x_i+1       and       y_i+1=y_i
            If T is chosen
            We have x_i+1=x_i+1       and       y_i+1=y_i+1

The actual y coordinates of the line at x = x_i+1is
            y=mx_i+1+b

The distance from S to the actual line in y direction
            s = y-y_i

The distance from T to the actual line in y direction
            t = (y_i+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 -1

Substituting m by  and introducing decision variable
                d_i=△x (s-t)
                d_i=△x (2  (x_i+1)+2b-2y_i-1)
                        =2△xy_i-2△y-1△x.2b-2y_i△x-△x
                d_i=2△y.x_i-2△x.y_i+c

Where c= 2△y+△x (2b-1)

We can write the decision variable d_i+1 for the next slip on
                d_i+1=2△y.x_i+1-2△x.y_i+1+c
                d_i+1-d_i=2△y.(x_i+1-x_i)- 2△x(y_i+1-y_i)

Since x_(i+1)=x_i+1,we have
                d_i+1+d_i=2△y.(x_i+1-x_i)- 2△x(y_i+1-y_i)

Special Cases

If chosen pixel is at the top pixel T (i.e., d_i≥0)⟹ y_i+1=y_i+1
                d_i+1=d_i+2△y-2△x

If chosen pixel is at the bottom pixel T (i.e., d_i<0)⟹ y_i+1=y_i
                d_i+1=d_i+2△y

Finally, we calculate d₁
                d₁=△x[2m(x₁+1)+2b-2y₁-1]
                d₁=△x[2(mx₁+b-y₁)+2m-1]

Since mx₁+b-y_i=0 and m = , we have
                d₁=2△y-△x

Advantage:

1. It involves only integer arithmetic, so it is simple.

2. It avoids the generation of duplicate points.

3. It can be implemented using hardware because it does not use multiplication and division.

4. It is faster as compared to DDA (Digital Differential Analyzer) because it does not involve floating point calculations like DDA Algorithm.

Disadvantage:

1. 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.

Bresenham's Line Algorithm:

Step1: Start Algorithm

Step2: Declare variable x₁,x₂,y₁,y₂,d,i₁,i₂,dx,dy

Step3: Enter value of x₁,y₁,x₂,y₂
                Where x₁,y₁are coordinates of starting point
                And x₂,y₂ are coordinates of Ending point

Step4: Calculate dx = x₂-x₁
                Calculate dy = y₂-y₁
                Calculate i₁=2*dy
                Calculate i₂=2*(dy-dx)
                Calculate d=i₁-dx

Step5: Consider (x, y) as starting point and x_endas maximum possible value of x.
                If dx < 0
                        Then x = x₂
                        y = y₂
                          x_end=x₁
                If dx > 0
                    Then x = x₁
                y = y₁
                        x_end=x₂

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

Step7: Check if whole line is generated.
                If x > = x_end
                Stop.

Step8: Calculate co-ordinates of the next pixel
                If d < 0
                    Then d = d + i₁
                If d ≥ 0
          Then d = d + i₂
                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: Starting and Ending position of the line are (1, 1) and (8, 5). Find intermediate points.

Solution: x₁=1
                y₁=1
                x₂=8
                y₂=5
                dx= x₂-x₁=8-1=7
                dy=y₂-y₁=5-1=4
                I₁=2* ∆y=2*4=8
                I₂=2*(∆y-∆x)=2*(4-7)=-6
                d = I₁-∆x=8-7=1

Program to implement Bresenham's Line Drawing Algorithm:

1. #include<stdio.h>  
2. #include<graphics.h>  
3. void drawline(int x0, int y0, int x1, int y1)  
4. {  
5.     int dx, dy, p, x, y;  
6.     dx=x1-x0;  
7.     dy=y1-y0;  
8.     x=x0;  
9.     y=y0;  
10.     p=2*dy-dx;  
11.     while(x<x1)  
12.     {  
13.         if(p>=0)  
14.         {  
15.             putpixel(x,y,7);  
16.             y=y+1;  
17.             p=p+2*dy-2*dx;  
18.         }  
19.         else  
20.         {  
21.             putpixel(x,y,7);  
22.             p=p+2*dy;}  
23.             x=x+1;  
24.         }  
25. }  
26. int main()  
27. {  
28.     int gdriver=DETECT, gmode, error, x0, y0, x1, y1;  
29.     initgraph(&gdriver, &gmode, "c:\\turboc3\\bgi");  
30.     printf("Enter co-ordinates of first point: ");  
31.     scanf("%d%d", &x0, &y0);  
32.     printf("Enter co-ordinates of second point: ");  
33.     scanf("%d%d", &x1, &y1);  
34.     drawline(x0, y0, x1, y1);  
35.     return 0;  
36. }  

Output:

Differentiate between DDA Algorithm and Bresenham's Line Algorithm: