Tag: Line Generation Algorithm in Computer Graphics

Mid Point Line Drawing Algorithm

Computer Graphics

Line Drawing Algorithms-

 

In computer graphics, popular algorithms used to generate lines are-

 

 

  1. Digital Differential Analyzer (DDA) Line Drawing Algorithm
  2. Bresenham Line Drawing Algorithm
  3. Mid Point Line Drawing Algorithm

 

In this article, we will discuss about Mid Point Line Drawing Algorithm.

 

Mid Point Line Drawing Algorithm-

 

Given the starting and ending coordinates of a line,

Mid Point Line Drawing Algorithm attempts to generate the points between the starting and ending coordinates.

 

Also Read- DDA Line Drawing Algorithm

 

Procedure-

 

Given-

  • Starting coordinates = (X0, Y0)
  • Ending coordinates = (Xn, Yn)

 

The points generation using Mid Point Line Drawing Algorithm involves the following steps-

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

These parameters are calculated as-

  • ΔX = Xn – X0
  • ΔY =Yn – Y0

 

Step-02:

 

Calculate the value of initial decision parameter and ΔD.

These parameters are calculated as-

  • Dinitial = 2ΔY – ΔX
  • ΔD = 2(ΔY – ΔX)

 

Step-03:

 

The decision whether to increment X or Y coordinate depends upon the flowing values of Dinitial.

Follow the below two cases-

 

 

Step-04:

 

Keep repeating Step-03 until the end point is reached.

For each Dnew value, follow the above cases to find the next coordinates.

 

PRACTICE PROBLEMS BASED ON MID POINT LINE DRAWING ALGORITHM-

 

Problem-01:

 

Calculate the points between the starting coordinates (20, 10) and ending coordinates (30, 18).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (20, 10)
  • Ending coordinates = (Xn, Yn) = (30, 18)

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

  • ΔX = Xn – X0 = 30 – 20 = 10
  • ΔY =Yn – Y0 = 18 – 10 = 8

 

Step-02:

 

Calculate Dinitial and ΔD as-

  • Dinitial = 2ΔY – ΔX = 2 x 8 – 10 = 6
  • ΔD = 2(ΔY – ΔX) = 2 x (8 – 10) = -4

 

Step-03:

 

As Dinitial >= 0, so case-02 is satisfied.

 

Thus,

  • Xk+1 = Xk + 1 = 20 + 1 = 21
  • Yk+1 = Yk + 1 = 10 + 1 = 11
  • Dnew = Dinitial + ΔD = 6 + (-4) = 2

 

Similarly, Step-03 is executed until the end point is reached.

 

Dinitial Dnew Xk+1 Yk+1
20 10
6 2 21 11
2 -2 22 12
-2 14 23 12
14 10 24 13
10 6 25 14
6 2 26 15
2 -2 27 16
-2 14 28 16
14 10 29 17
10 30 18

 

 

Problem-02:

 

Calculate the points between the starting coordinates (5, 9) and ending coordinates (12, 16).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (5, 9)
  • Ending coordinates = (Xn, Yn) = (12, 16)

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

  • ΔX = Xn – X0 = 12 – 5 = 7
  • ΔY =Yn – Y0 = 16 – 9 = 7

 

Step-02:

 

Calculate Dinitial and ΔD as-

  • Dinitial = 2ΔY – ΔX = 2 x 7 – 7 = 7
  • ΔD = 2(ΔY – ΔX) = 2 x (7 – 7) = 0

 

Step-03:

 

As Dinitial >= 0, so case-02 is satisfied.

 

Thus,

  • Xk+1 = Xk + 1 = 5 + 1 = 6
  • Yk+1 = Yk + 1 = 9 + 1 = 10
  • Dnew = Dinitial + ΔD = 7 + 0 = 7

 

Similarly, Step-03 is executed until the end point is reached.

 

Dinitial Dnew Xk+1 Yk+1
5 9
7 7 6 10
7 7 7 11
7 7 8 12
7 7 9 13
7 7 10 14
7 7 11 15
7 12 16

 

 

Advantages of Mid Point Line Drawing Algorithm-

 

The advantages of Mid Point Line Drawing Algorithm are-

  • Accuracy of finding points is a key feature of this algorithm.
  • It is simple to implement.
  • It uses basic arithmetic operations.
  • It takes less time for computation.
  • The resulted line is smooth as compared to other line drawing algorithms.

 

Also Read- Bresenham Line Drawing Algorithm

 

Disadvantages of Mid Point Line Drawing Algorithm-

 

The disadvantages of Mid Point Line Drawing Algorithm are-

  • This algorithm may not be an ideal choice for complex graphics and images.
  • In terms of accuracy of finding points, improvement is still needed.
  • There is no any remarkable improvement made by this algorithm.

 

To gain better understanding about Mid Point Line Drawing Algorithm,

Watch this Video Lecture

 

Next Article- Mid Point Circle Drawing Algorithm

 

Get more notes and other study material of Computer Graphics.

Watch video lectures by visiting our YouTube channel LearnVidFun.

Bresenham Line Drawing Algorithm

Computer Graphics

Line Drawing Algorithms-

 

In computer graphics, popular algorithms used to generate lines are-

 

 

  1. Digital Differential Analyzer (DDA) Line Drawing Algorithm
  2. Bresenham Line Drawing Algorithm
  3. Mid Point Line Drawing Algorithm

 

In this article, we will discuss about Bresenham Line Drawing Algorithm.

 

Bresenham Line Drawing Algorithm-

 

Given the starting and ending coordinates of a line,

Bresenham Line Drawing Algorithm attempts to generate the points between the starting and ending coordinates.

 

Also Read- DDA Line Drawing Algorithm

 

Procedure-

 

Given-

  • Starting coordinates = (X0, Y0)
  • Ending coordinates = (Xn, Yn)

 

The points generation using Bresenham Line Drawing Algorithm involves the following steps-

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

These parameters are calculated as-

  • ΔX = Xn – X0
  • ΔY =Yn – Y0

 

Step-02:

 

Calculate the decision parameter Pk.

It is calculated as-

Pk = 2ΔY – ΔX

 

Step-03:

 

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

Find the next point depending on the value of decision parameter Pk.

Follow the below two cases-

 

 

Step-04:

 

Keep repeating Step-03 until the end point is reached or number of iterations equals to (ΔX-1) times.

 

PRACTICE PROBLEMS BASED ON BRESENHAM LINE DRAWING ALGORITHM-

 

Problem-01:

 

Calculate the points between the starting coordinates (9, 18) and ending coordinates (14, 22).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (9, 18)
  • Ending coordinates = (Xn, Yn) = (14, 22)

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

  • ΔX = Xn – X0 = 14 – 9 = 5
  • ΔY =Yn – Y0 = 22 – 18 = 4

 

Step-02:

 

Calculate the decision parameter.

Pk

= 2ΔY – ΔX

= 2 x 4 – 5

= 3

So, decision parameter Pk = 3

 

Step-03:

 

As Pk >= 0, so case-02 is satisfied.

 

Thus,

  • Pk+1 = Pk + 2ΔY – 2ΔX = 3 + (2 x 4) – (2 x 5) = 1
  • Xk+1 = Xk + 1 = 9 + 1 = 10
  • Yk+1 = Yk + 1 = 18 + 1 = 19

 

Similarly, Step-03 is executed until the end point is reached or number of iterations equals to 4 times.

(Number of iterations = ΔX – 1 = 5 – 1 = 4)

 

Pk Pk+1 Xk+1 Yk+1
9 18
3 1 10 19
1 -1 11 20
-1 7 12 20
7 5 13 21
5 3 14 22

 

 

Problem-02:

 

Calculate the points between the starting coordinates (20, 10) and ending coordinates (30, 18).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (20, 10)
  • Ending coordinates = (Xn, Yn) = (30, 18)

 

Step-01:

 

Calculate ΔX and ΔY from the given input.

  • ΔX = Xn – X0 = 30 – 20 = 10
  • ΔY =Yn – Y0 = 18 – 10 = 8

 

Step-02:

 

Calculate the decision parameter.

Pk

= 2ΔY – ΔX

= 2 x 8 – 10

= 6

So, decision parameter Pk = 6

 

Step-03:

 

As Pk >= 0, so case-02 is satisfied.

 

Thus,

  • Pk+1 = Pk + 2ΔY – 2ΔX = 6 + (2 x 8) – (2 x 10) = 2
  • Xk+1 = Xk + 1 = 20 + 1 = 21
  • Yk+1 = Yk + 1 = 10 + 1 = 11

 

Similarly, Step-03 is executed until the end point is reached or number of iterations equals to 9 times.

(Number of iterations = ΔX – 1 = 10 – 1 = 9)

 

Pk Pk+1 Xk+1 Yk+1
20 10
6 2 21 11
2 -2 22 12
-2 14 23 12
14 10 24 13
10 6 25 14
6 2 26 15
2 -2 27 16
-2 14 28 16
14 10 29 17
10 6 30 18

 

 

Advantages of Bresenham Line Drawing Algorithm-

 

The advantages of Bresenham Line Drawing Algorithm are-

  • It is easy to implement.
  • It is fast and incremental.
  • It executes fast but less faster than DDA Algorithm.
  • The points generated by this algorithm are more accurate than DDA Algorithm.
  • It uses fixed points only.

 

Disadvantages of Bresenham Line Drawing Algorithm-

 

The disadvantages of Bresenham Line Drawing Algorithm are-

  • Though it improves the accuracy of generated points but still the resulted line is not smooth.
  • This algorithm is for the basic line drawing.
  • It can not handle diminishing jaggies.

 

To gain better understanding about Bresenham Line Drawing Algorithm,

Watch this Video Lecture

 

Next Article- Mid Point Line Drawing Algorithm

 

Get more notes and other study material of Computer Graphics.

Watch video lectures by visiting our YouTube channel LearnVidFun.

DDA Algorithm | Line Drawing Algorithms

Computer Graphics

Line Drawing Algorithms-

 

In computer graphics, popular algorithms used to generate lines are-

 

 

  1. Digital Differential Analyzer (DDA) Line Drawing Algorithm
  2. Bresenham Line Drawing Algorithm
  3. Mid Point Line Drawing Algorithm

 

In this article, we will discuss about DDA Algorithm.

 

DDA Algorithm-

 

DDA Algorithm is the simplest line drawing algorithm.

 

Given the starting and ending coordinates of a line,

DDA Algorithm attempts to generate the points between the starting and ending coordinates.

 

Procedure-

 

Given-

  • Starting coordinates = (X0, Y0)
  • Ending coordinates = (Xn, Yn)

 

The points generation using DDA Algorithm involves the following steps-

 

Step-01:

 

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

These parameters are calculated as-

  • ΔX = Xn – X0
  • ΔY =Yn – Y0
  • M = ΔY / ΔX

 

Step-02:

 

Find the number of steps or points in between the starting and ending coordinates.

 

if (absolute (ΔX) > absolute (ΔY))

Steps = absolute (ΔX);

else

Steps = absolute (ΔY);

 

Step-03:

 

Suppose the current point is (Xp, Yp) and the next point is (Xp+1, Yp+1).

Find the next point by following the below three cases-

 

 

Step-04:

 

Keep repeating Step-03 until the end point is reached or the number of generated new points (including the starting and ending points) equals to the steps count.

 

PRACTICE PROBLEMS BASED ON DDA ALGORITHM-

 

Problem-01:

 

Calculate the points between the starting point (5, 6) and ending point (8, 12).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (5, 6)
  • Ending coordinates = (Xn, Yn) = (8, 12)

 

Step-01:

 

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

  • ΔX = Xn – X0 = 8 – 5 = 3
  • ΔY =Yn – Y0 = 12 – 6 = 6
  • M = ΔY / ΔX = 6 / 3 = 2

 

Step-02:

 

Calculate the number of steps.

As |ΔX| < |ΔY| = 3 < 6, so number of steps = ΔY = 6

 

Step-03:

 

As M > 1, so case-03 is satisfied.

Now, Step-03 is executed until Step-04 is satisfied.

 

Xp Yp Xp+1 Yp+1 Round off (Xp+1, Yp+1)
5 6 5.5 7 (6, 7)
6 8 (6, 8)
6.5 9 (7, 9)
7 10 (7, 10)
7.5 11 (8, 11)
8 12 (8, 12)

 

 

Problem-02:

 

Calculate the points between the starting point (5, 6) and ending point (13, 10).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (5, 6)
  • Ending coordinates = (Xn, Yn) = (13, 10)

 

Step-01:

 

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

  • ΔX = Xn – X0 = 13 – 5 = 8
  • ΔY =Yn – Y0 = 10 – 6 = 4
  • M = ΔY / ΔX = 4 / 8 = 0.50

 

Step-02:

 

Calculate the number of steps.

As |ΔX| > |ΔY| = 8 > 4, so number of steps = ΔX = 8

 

Step-03:

 

As M < 1, so case-01 is satisfied.

Now, Step-03 is executed until Step-04 is satisfied.

 

Xp Yp Xp+1 Yp+1 Round off (Xp+1, Yp+1)
5 6 6 6.5 (6, 7)
7 7 (7, 7)
8 7.5 (8, 8)
9 8 (9, 8)
10 8.5 (10, 9)
11 9 (11, 9)
12 9.5 (12, 10)
13 10 (13, 10)

 

 

Problem-03:

 

Calculate the points between the starting point (1, 7) and ending point (11, 17).

 

Solution-

 

Given-

  • Starting coordinates = (X0, Y0) = (1, 7)
  • Ending coordinates = (Xn, Yn) = (11, 17)

 

Step-01:

 

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

  • ΔX = Xn – X0 = 11 – 1 = 10
  • ΔY =Yn – Y0 = 17 – 7 = 10
  • M = ΔY / ΔX = 10 / 10 = 1

 

Step-02:

 

Calculate the number of steps.

As |ΔX| = |ΔY| = 10 = 10, so number of steps = ΔX = ΔY = 10

 

Step-03:

 

As M = 1, so case-02 is satisfied.

Now, Step-03 is executed until Step-04 is satisfied.

 

Xp Yp Xp+1 Yp+1 Round off (Xp+1, Yp+1)
1 7 2 8 (2, 8)
3 9 (3, 9)
4 10 (4, 10)
5 11 (5, 11)
6 12 (6, 12)
7 13 (7, 13)
8 14 (8, 14)
9 15 (9, 15)
10 16 (10, 16)
11 17 (11, 17)

 

 

Advantages of DDA Algorithm-

 

The advantages of DDA Algorithm are-

  • It is a simple algorithm.
  • It is easy to implement.
  • It avoids using the multiplication operation which is costly in terms of time complexity.

 

Disadvantages of DDA Algorithm-

 

The disadvantages of DDA Algorithm are-

  • There is an extra overhead of using round off( ) function.
  • Using round off( ) function increases time complexity of the algorithm.
  • Resulted lines are not smooth because of round off( ) function.
  • The points generated by this algorithm are not accurate.

 

To gain better understanding about DDA Algorithm,

Watch this Video Lecture

 

Next Article- Bresenham Line Drawing Algorithm

 

Get more notes and other study material of Computer Graphics.

Watch video lectures by visiting our YouTube channel LearnVidFun.