'l'E~mtT)) ~efl> b (Bw) Co1Y\fLd~ (j~hiU,
(REVISED COURSE)
( 3 Hours)
Question No.1 is compulsory.
Attempt any four questions out of remaining Le.2 to 7.
Figur~s to right indicate full marks.
Figures supporting answers should b~ neat and clean.
Con. 5531-07.
~'lp2..)eT-
CD-5572
[Total Marks: 100
.N. B.: (1)
(2)
(3)
(4)
1. (a) With reference to 3 0 transformations, describe the steps to be carried out when 12
an object is to be rotated about an axis that is not parallel to any of the co-ordinate
axis specify all the required matrices. State your assumptions clearly.
(b) Write and explain the Depth Buffer algorithm for detecting visible surface. 8
2. (a) Derive the transformations for producing perspective projection of an object, in xy 12
plane (viewing plane) and 'cOP (centre of projection) co-ordinates are (a, b, c).
(b) Write notes on eSG and B-REP technic. 8
3. (a) Compareboundaryfill andflood fill algorithm.Write a functionto fill a region,whose 10
boundaries are of different color, using 8 connected approach.
(b) State mathematicalequations for Bezier Curves and Bezier Surfaces. Explain properties 10
of Bezier Curve.
,---.
4. (a) Find the clipping co-ordinates to clip the line segment AS against the window using 10
Cohen-Sutherland line clipping algorithm.
.A (120, 60), B (160, 92)
X-100 Y -80
w min -w min -
Xw max= 150' Yw max = 100
(b) Explain working of Raster scan display and Random scan display and compare them. 10
5. (a) Explain Gourad and phong shading.
(b) Prove the following
1. Two successive rotations are additive
.Le. R (81). R (82) = R (81 + 82)
2. If Sx= Sy or 8 = n 7Cprove that 2D rotation and scaling compute.
10
10
6. (a) Derive the Bresenham's line drawing algorithm for lines with slope < 1. Use it to 12
digitize the line with end_points A (40, 10) and 8 (50, 16). Calculate first 3
points only. .
(b) Explain scan-line fill algorithm to fill 20 area. 8
7. (a) Explain Liang-Barsky line clipping algorithm with example.
(b) Write notes on Halftoning and Dithering technics.
10
10