Scribd
Upload
6 views2 pages

Line Drawing Algos

The document outlines the calculations for points on lines using three algorithms: Digital Differential Analyzer (DDA), Bresenham Line Drawing, and Mid Point Line Drawing. It provides specific problems with starting and ending coordinates, detailing the steps and calculations involved in each algorithm. Each algorithm aims to determine the intermediate points between the given coordinates for line drawing in computer graphics.

Uploaded by

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

Line Drawing Algos

The document outlines the calculations for points on lines using three algorithms: Digital Differential Analyzer (DDA), Bresenham Line Drawing, and Mid Point Line Drawing. It provides specific problems with starting and ending coordinates, detailing the steps and calculations involved in each algorithm. Each algorithm aims to determine the intermediate points between the given coordinates for line drawing in computer graphics.

Uploaded by

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

Digital Differential Analyzer (DDA) Line Drawing Algorithm -

Problem-02:
Calculate the points between the starting point (5, 6) and ending point (13, 10).
Problem-03
Calculate the points between the starting point (1, 7) and ending point (11, 17).

Bresenham Line Drawing Algorithm-


Given the starting and ending coordinates of a line, Bresenham Line Drawing Algorithm attempts to
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).
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).

You might also like