Subject Name: Computer Graphics
Department: BCA
Created By: Dr. Sanjeev Punia
JIMS Engineering Management Technical Campus
48/4, Knowledge Park – III, Greater Noida - 201306
(Affiliated to Guru Gobind Singh Indraprastha University, New Delhi
Subject: Computer Graphics (BCA 303)
Topic: Classification of Scan Conversion
CLASSIFICATION
OF
SCAN CONVERSION
3
Scan Conversion Techniques
Find the next PIXEL position on Screen
It used to draw :
1. Line
2. Circle
3. Curve
also called Rasterization
4
Scan Conversion Techniques
Line Generation Algorithms :
1. DDA Line Drawing Algorithm
2. Bresenham’s Line Drawing Algorithm
5
Scan Conversion Techniques
Circle Generation Algorithms :
1. DDA Circle Drawing Algorithm
2. Bresenham’s Circle Drawing Algorithm
3. Mid Point Circle Drawing Algorithm
6
Scan Conversion Techniques
Curve Generation Algorithms :
1. DDA Curve Generation Algorithm
2. Bezier Curve Generation Algorithm
3. B-splin Curve Generation Algorithm
7
Scan Conversion Techniques
Line Generation
DDA Line Drawing Algorithm
(Digital Differential Analyzer)
8
DDA Line Drawing Algorithm
(Digital Differential Analyzer)
Step 1: Enter the value of starting point
(X1,Y1) and end point (X2,Y2)
Step 2: Xk=X1 and Yk=Y1
Step 3: Calculate the slope of line i.e. m
m = (Y2-Y1) / (X2-X1)
Step 4: Check value of m
9
DDA Line Drawing Algorithm
Step 5: If m == 1 CASE I
Step 6: for ( Xk=X1; Xk<=X2; Xk++ )
Plot the point Xk and Yk
Yk= Yk+ 1
10
DDA Line Drawing Algorithm
Step 7: If m < 1 CASE II
Step 8: for ( Xk=X1; Xk<=X2; Xk++ )
Plot the point Xk and (abs) Yk
Yk= Yk + m
11
DDA Line Drawing Algorithm
Step 9: If m > 1 CASE III
Step 10:for ( Yk=Y1; Yk<=Y2; Yk++ )
Plot the point (abs) Xk and Yk
Xk= Xk + 1/m
Step 11: Exit
12
Advantage & Disadvantage
Advantage
1. Not Require advance skill
2. Fast method for line generation
Disadvantage
More computation is required in case
of floating point arithmatic operation
13
Next…..
EXAMPLE - SCAN CONVERSION
14
Thank You !!