Computer Graphics & Virtual Reality - May 2015
Information Technology (Semester 5)
TOTAL MARKS: 80
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks. 1 (a) Explain Besenham's line drawing algorithm with suitable example.(10 marks) 1 (b) Explain bitmap and vector based graphics.(5 marks) 1 (c) Compare CMYK and RGB colour model.(5 marks) 2 (a) Explain sutherland-Hodgeman polygone clipping algorithm with suitable example.(10 marks) 2 (b) What are the different types of projections? Derive the matrix representation for perspective transformation in xy plane and on negative z axis.(10 marks) 3 (a) Compare mesh and features based wrapping method.(10 marks) 3 (b) Explain in detail any VR toolkit.(10 marks) 4 (a) Explain Flood Fill Algorithm using 8 connected approach. What are its advantages over Boundary Fill Algorithm.(10 marks) 4 (b) Derive mathemtical representation of Bezier curve. State their properties.(10 marks) 5 (a) Describe Halftoning, Thresholding and Dithering in detail with application in real world.(10 marks) 5 (b) Explain B-spline curve.(10 marks) 6 (a) What are different applications of computer graphics.(5 marks) 6 (b) Advantages of 3D morphing over 2D morphing.(5 marks) 6 (c) Explain even-odd method for inside test of polygon.(5 marks) 6 (d) Explain collision detection in VR.(5 marks)