Computer Graphics - Dec 2014
Information Technology Engineering (Semester 4)
TOTAL MARKS: 100
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.
Answer any one question from Q1 and Q2
1 (a) Differentiate between random scan and raster scan display.(6 marks) 1 (b) What is Homogeneous Coordinate System ? Compare homogeneous and normalized co-ordinates.(6 marks) 2 (a) Write steps for filling polygon using scan line method.(6 marks) 2 (b) Rasterize a line from (0, 0) to (8, 4) using DDA algorithm.(6 marks)
Answer any one question from Q3 and Q4
3 (a) What is segment ? Explain segment creation operation.(6 marks) 3 (b) Obtain the 3D Transformation matrix for rotation about any arbitrary axis.(6 marks) 4 (a) In 2D clipping how are line grouped into visible, invisible and partially visible categories?(6 marks) 4 (b) Explain ways of projecting 3D objects onto 2D screen in detail.(6 marks)
Answer any one question from Q5 and Q6
5 (a) Explain CIE chromaticity diagram; also explain how RGB to CMY conversion is done(6 marks) 5 (b) What are the different steps in animation sequence? Explain each step in brief.(7 marks) 6 (a) Explain pseudo C algorithm for Gourand shading.(6 marks) 6 (b) What are the different ways in which motions of the objects can be specified? Explain each in brief.(7 marks)
Answer any one question from Q7 and Q8
7 (a) What are the properties of Bezier curve ? Describe the procedure to generate Bezier curve.(6 marks) 7 (b) What is interpolation? Explain the process of curve approximation by Lagrange interpolation method.(7 marks) 8 (a) Explain Hilbert curve in detail.(6 marks) 8 (b) Give the set of equations of Bezier curve. Write the algorithm for drawing a Bezier curve section using four points.(7 marks)