Paper / Subject Code:

23
ga
31DZV

(3llours)

N.B: 1) Question number I is

2) Attempt any three out of
3) Assume suitable data if th..g assumptiuhs.
4) Figures to the right indicgte full
.1, ,l

Qr a) What are homogeneous coordinates? Write a homogenous transformation maffix for IOJI
translation, scaling, and rotation
b) Explain the working of the Raster scan $ystem with a neat diagram, [0sl

c) Explain any 5 principles of animation. [0s]

d) Scale a triangle A(4,4), B(12,4) and C(s,lO) with scaling factor Sx: 2 and S5l. Issl
L
Q2a) \Mrite a midpoint circle drawing algorithm. Apply this algorithm to find pixel ll0l
coordinates of the circular boundary only for the first quadrant, whose radius is 8
units.
b) Rotate a line segment with endpoint A (3,3) to B(10,10) in a clockwise direction by u0l
an qgle 45 degrees by keeping A (3,3) as fixed point. Find new transformed
coorihtes of a line.

Q3a) Explain Flood fill and boundary fill algorithm with a suitable example. Write merits [101
and demerits of the same.
b) Derive transformation matrix for 2D rotation about a fixed point.

Q4 a) Explain the z-buffer algorithm for hidden surface removal with a suitable example. t10l
b) Explain Sutherland-Hodgeman polygon clipping algorithm with a suitable example. u0l
I
Q5 a) What is Bezier crrve? Write importantproperties of the Bezier curve. t10I

YY b) What do you mean by line chpping? Explain Cohen-Sutherland line clipping ll0l
algorithm with a suitable exanple.
,.]
,i{,;
Q6 a) Write a note on 3D projections. t0sl
t0sl
t0sl

t0sl

J
t
 E7

E7
7
B

B
23
Paper / Subject Code: 50925 / Computer Graphics

E9

E9
Y1

Y1
BX
E7

E7
37

37

B
E9

E9
Y1

Y1
X2

X2
E7

E7
37

37
9B

9 B
Y1

1
X2

2
7E

Y
X
E7
37

37
B

B
Duration: 3 Hours Total Marks 80

1E

9
Y1
X2

2
E

7E
7Y

BX
7

37
B
N.B: 1) Question number 1 is compulsory.

1E

1E
23

3
E9

E9
2

2
7Y

7Y
BX

BX

BX
E7

E7
2) Attempt any three out of the remaining.

23
E9

E9

E9
Y1

Y1
X 2

BX
E7

E7
37

37
B

E
3) Assume suitable data if necessary and justify the assumptions.

E9
Y1

Y1

1
X2

X2
E

7Y
E7

7
37

37
9B

B
E

E
4) Figures to the right indicate full marks.

23
9
1

Y1

Y1
X2

2
7E

7E
Y

BX

BX
7

37

37
9B

1E
3

E9

E9
1
X2

X2

2
7E

7Y

Y
Q.1 Attempt any four 20

X
7

E7
37
9B

B
1E

E
3
i. Give applications of Computer Graphics.

E9

9
1

1
2

X2
7E

7E
7Y

7Y
X

7
ii. What is an antialiasing? Explain any 3 antialiasing techniques.

7
9B

B
E

1E
23

23

3
E9

E9
1

Y1

X2
iii. Compare DDA and BRESENHAM line drawing algorithm.

7E
Y

7Y
BX

E7

E7
7

37
B

B
E
iv. Explain Viewing transformation pipeline.
23

23
E9

9
1

Y1

Y1
X2
7E

E
Y
BX

BX
v. Give fractal dimension of Koch curve.
E7

E7
7

37

37
9B
E
3
E9

9
Y1

Y1
X2

X2

X2
E

7E
Y
E7

7
37

Q.2 37 20

7
9B

9B
1E

1E
23
E9
Y1
2

X2
7E

a. Given a line AB where A(0,0) and B(1,3) find out all the coordinates of line

7E
7Y

7Y
BX

BX
E7
37

9B
1E

1E
AB using DDA algorithm. 3

23
E9

E9
Y1
2

2
7E
Y

7Y
BX

BX

BX
b. Describe different traditional animation techniques.
E7

E7
7

37
E
3

23
E9

E9
Y1

Y1
2

X2
E
Y
BX

BX
E7

E7

7
37

37
9B
Q.3 20

1E
3
E9

E9
Y1

1
X2

2
7E
Y

7Y
a. Describe homogeneous coordinates.
X

BX
E7

E7
37

7
9B

E
3

23
b. Describe with neat diagram Boundary Fill and Flood fill algorithm.
E9

E9
Y1

Y1
X2

2
7E

7Y
X

BX
E7

7
37

37
9B

9B
E

E
3

E9
Y1

1
X2

X2
Q.4 20
7E

7E
Y

Y
X

E7
37

37

7
9B

9B

9B
E

1E

a. Derive window to viewport coordinate transformation.

23
Y1

Y1
X2

X2
7E

7E

7E
Y

BX

b. Derive matrix for 2D rotation at any arbitrary (fix) point.

37

37
9B

9B
1E

1E

1E
23

9
X2

X2
7E

7E

7E
7Y

7Y
BX

Q.5
7

20
9B

9B
1E

E
23

23
9
Y1

1
2
7E

7E

a. Give properties of Bezier curve.

7E
7Y

Y
BX

BX
37

37
9B
1E

1E
23

b. Describe with neat diagram Sutherland Hodgman polygon clipping

E9

E9
Y1
X2

X2
7E
7Y

7Y
BX

algorithm.
E7

E7
37
9B

9B
1E
23

23
E9

Y1

Y1
X2
7E

7E
Y
BX

BX
37

37
9B

Q.6 20
1E

1E
3
E9

E9
X2

X2
7E
7Y

a. Describe with neat diagram Depth Buffer algorithm.

X
E7

E7
7
9B

9B

9B
1E
23

b. What is projection? Explain with neat diagram different perspective

Y1

Y1
2
7E

7E

7E
7Y
BX

projections.
37

37
B
1E

1E

1E
23
E9

E9
X2

X2
7Y

7Y

7Y
BX
E7

E7

9B
23

23

23
E9
Y1

7E
Y
BX

BX

BX
E7
37

37

1E
E9

E9

_____________
E9
Y1
X2

X2

Y
E7

E7

E7
37

7
9B

9B

23
Y1

Y1

Y1
X2
7E

7E

BX
37

37
9B
1E

1E

9
X2

X2
7E

7E
7Y

7Y
9B

9B
1E

1E
23

23
7E

7E
7Y

7Y
BX

BX
1E

1E
23

23
E9

E9
7Y

7Y
BX

BX
E7
23

23
E9

E9
Y1
BX

BX
E7

E7
37

54849 Page 1 of 1
E9

E9
Y1

Y1
X2
E7

E7
37

37
9B
Y1

Y1
X2

X2
7E
37

37
9B
1E
X2

X2

X237Y1E7E9BX237Y1E7E9BX237Y1E7E9BX237Y1E7E9B
7E
7Y
 q E eern TIL ff-l-g LomPulev- 6H * >s
Paper I Swbject Code: 50925 / Computer Graphics

@? coat - 71BgLl 2l lLl23

Time:3 Hours Total Marks: 8o

N.B. I. Question No, I is compulsory
2. Attempt any 3 from remaining questions.
3. Assume any suitable data if necessary and justify the assumptions.

Q.1 Attempt any Four 4x5=20

l. Compare DDA and BRESENHAM line drawing algorithm.

2. Give application of computer graphics.
3. Explain with neat diagram rasterization,
4. Give liactal dimension of KOCFI cuft'e.
5. Define Projection, Desoribe perspective projection with neat diagram.

Q.U 2A

1. Giverr a triangle ABC where A(U.0), ts(10.10) and C(20,0). scale the given triangle ABC 2-
unit in X direction and 0"5-unit in Y direction. Find out the new coordinate of triangle ABC
after scaling.
2. Explain with neat diagram Sutherland and Hodgman polygon clipping algorithm in detail.

Q.3 20

1. Derive windovu' to viervporl coordinate transformation

2. Give properties of Bezier cltrve.

,
::..
Q,4 2A

1" Derive lvf id-point circle generation algorithm.

2. Give principles of animation

L Q.s 2A

t. E>tplain with neat diagram Area Sub division (Warnock's) algorithm to remove hidden
surfaces.
: 2. f)erive matrix t'or 2D rotation transl'orntation.

',, J''
Q.6 Attempf any Four 20

l. Explain point clipping algorithnr.

2. Give pseudo code for 4-connect Boundary fill algorithm.
3. Give transformation matrix for 3D - Translation, Scaling, Rotation (about x, y. z axis)
4. Explain with neat diagram composite transformation for scaling.

5. Giverr a line AB where A(0,0) and B( 1,3) find out all the coordinate of line AB using DDA
algorithrn.

Page 1 of 1

C8I.-BDCA i 65F35CDA4C2D2BBCD I 68OC5C