KEMBAR78
Mid-Point Line Algorithm Guide | PDF | Cybernetics | Computational Science
Scribd
Upload
128 views8 pages

Mid-Point Line Algorithm Guide

The mid-point line drawing algorithm generates points between a starting and ending coordinate by calculating the change in x and y values, an initial decision parameter, and the change in the decision parameter. It then uses these values in a step-by-step process to determine the next x and y coordinates by incrementing x or y based on whether the decision parameter is greater than or equal to 0. This continues until the ending coordinate is reached. The algorithm is simple to implement, uses basic arithmetic, and produces a smooth line, but may not be suitable for complex graphics and its accuracy could be improved.

Uploaded by

Format Book
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
128 views8 pages

Mid-Point Line Algorithm Guide

The mid-point line drawing algorithm generates points between a starting and ending coordinate by calculating the change in x and y values, an initial decision parameter, and the change in the decision parameter. It then uses these values in a step-by-step process to determine the next x and y coordinates by incrementing x or y based on whether the decision parameter is greater than or equal to 0. This continues until the ending coordinate is reached. The algorithm is simple to implement, uses basic arithmetic, and produces a smooth line, but may not be suitable for complex graphics and its accuracy could be improved.

Uploaded by

Format Book
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Mid-Point Line Drawing Algorithm

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

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.

Procedure-

Given-
 Starting coordinates = (X0, Y0)
 Ending coordinates = (Xn, Yn)

The points generation using Mid Point Line Drawing Algorithm involves the following steps-
Mid-Point Line Drawing Algorithm
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-
Mid-Point Line Drawing Algorithm

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-
Mid-Point Line Drawing Algorithm
 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
Mid-Point Line Drawing Algorithm

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
Mid-Point Line Drawing Algorithm

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
Mid-Point Line Drawing Algorithm
 Δ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
Mid-Point Line Drawing Algorithm

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

You might also like