Computer Graphics - May 2012

Computer Engineering (Semester 4)

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) What are applications of computer graphics.(5 marks) 1 (b) Explain frame by frame animation.(5 marks) 1 (c) Explain Ray Tracing.(5 marks) 1 (d) Explain antialiasing techniques.(5 marks) 2 (a) Write Bresenham's line drawing algorithm also write mathematical derivations for the same.(10 marks) 2 (b) Explain 4-connected and 8-connected methods. Also explain flood fill and boundary fill algorithms.(10 marks) 3 (a) What is segment? Explain segment table and any 4 operations which can be performed on segments.(10 marks) 3 (b) Explain Liang Barsky line clipping algorithm.(10 marks) 4 (a) Explain Sutherland-Hodgeman polygon clipping algorithm. How Welier-Athorton algorithm solves the problem of concave polygon clipping?(12 marks) 4 (b) Describe HSV and RGB color model.(8 marks) 5 (a) Explain the rotation of an object about an arbitrary point. Derive composite matrix for the same.(10 marks) 5 (b) Describe 3D clipping of an object.(10 marks) 6 (a) Explain Painter's algorithm.(10 marks) 6 (b) Explain Bezier curve and write properties of Bezier curve.(10 marks) 7 (a) Explain and compare Phong Shading and Gouraud Shading.(10 marks) 7 (b) Describe Diffuse Illumination and Point-source Illumination.(10 marks)