CgFeb - 2023
CgFeb - 2023
CgFeb - 2023
8
23
PA-4982 [Total No. of Pages : 2
ic-
[6008]-234
tat
8s
S.E. (Information Technology) (Insem.)
7:0
COMPUTER GRAPHICS
02 91
5:1
(2019 Pattern) (214453) (Semester - II)
0
31
8/0 13
Time : 1 Hour] [Max. Marks : 30
0
4/2
Instructions to the candidates:
.23 GP
8
C
23
3) Figures to the right indicate full marks.
ic-
4) Assume Suitable data, if necessary.
16
tat
8.2
8s
Q1) a) Consider a line from A (5,7) to B (10, 15). Use DDA line drawing algorithm
.24
7:0
to rasterize the line from A to B. Draw the pixel wise rasterization of Line.
91
49
[8]
5:1
30
31
b) Explain display file structure. Why is display file interpreter used? Which
01
OR
8/0
Q2) a) Explain Mid-point circle drawing algorithm? List its advantages and
CE
80
8
disadvantages over DDA circle drawing algorithm. [8]
23
.23
b)
ic-
What is aliasing and anti-aliasing? How aliasing effect is removed in vector
16
tat
generation algorithm? [7]
8.2
8s
.24
7:0
91
49
5:1
Q3) a) Apply the shearing transformation to square with A (0, 0), B (1, 0), C(1, 1),
30
ii) Shear Parameter value of 0.5 relative to the line X_ref = –1.
8/0
Explain even-odd method for testing a pixel inside or outside the polygon.
.23
16
[7]
8.2
OR
.24
49
P.T.O.
Q4) a) Perform a 450 rotation of triangle A (0,0), B( 1,1), C (5,2) [8]
8
23
i) About the origin (0,0)
ic-
tat
ii) About P (–1, –1)
8s
b) What are the steps involved in filling polygon in scan line algorithm? [7]
7:0
02 91
5:1
0
31
8/0 13
0
4/2
.23 GP
E
80
8
C
23
ic-
16
tat
8.2
8s
.24
7:0
91
49
5:1
30
31
01
02
4/2
GP
8/0
CE
80
8
23
.23
ic-
16
tat
8.2
8s
.24
7:0
91
49
5:1
30
31
01
02
4/2
GP
8/0
CE
80
.23
16
8.2
.24
49
[6008]-234 2