Computer Graphics - Dec 2014
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) Explain 8 connected flood fill algorithm in detail.(5 marks) 1 (b) Differentiate between random scan and raster scan techniques.(5 marks) 1 (c) Explain Liang Barsky line clipping algorithm in detail.(10 marks) 2 (a) Derive Bressenham's line drawing algorithm for lines with slope <1(10 marks) 2 (b) Explain parallel and perspective projection and derive the matrix for perspective projection.(10 marks) 3 (a) Derive the matrix for 2D rotation about an arbitary point.(10 marks) 3 (b) Explain Gouraud and phong shading along with their advantages and disadvantages.(10 marks) 4 (a) Explain midpoint circle algorithm. Use the same to plot the circle, whose radius is 10 units.(10 marks) 4 (b) Explain any one polygon clipping method in detail.(10 marks) 5 (a)
Define window, viewport and hence derive window to viewport transformation.(10 marks) 5 (b) Explain what is meant by Bezier curve. State its properties and hence explain how a Bezier surface can be generated from Bazier curve.(10 marks) 6 (b) Open GL basic primitives(10 marks) 6 (c) Sweep representation(10 marks)
Write short notes on any two following:-
6(a) Half toning and dithering techniques.(10 marks)