Computer Graphics - Dec 2013

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 character generation methods. (5 marks) 1 (b) Explain inside outside test used in polygon filling.(5 marks) 1 (c) What is antialiasing? How it can be reduced? (5 marks) 1 (d) Explain z-buffer algorithm for removing hidden surface.(5 marks) 2 (a) Explain flood fill algorithm using 8 connected approach. Give its advantages and disadvantages.(10 marks) 2 (b) Derive Bresenham's line drawing algorithm. Plot a line by using Bresenham s line generation algorithm from (1, 1) to (5, 3).(10 marks) 3 (a) Translate the square ABCD whose co-ordinates are A (0, 0), B (3, 0), C (3, 3), D (0, 3) by 2 units in both direction and then scale it by 1.5 in x direction and 0.5 units in y direction.(10 marks) 3 (b) List and explain operations on segment. (10 marks) 4 (a) Find the clipping coordinate to clip the line segment AB against the window using Cohen-Sutherland line clipping algorithm. (10 marks) 4 (b) Explain Warnock's algorithm.(10 marks) 5 (a) State important properties of Bezier curve. Compare Bezier curve and B-spline curve. (10 marks) 5 (b) Explain parallel and prospective projection. Derive matrix for perspective projection.(10 marks) 6 (a) Explain 3D object representation methods.(10 marks) 6 (b) Define window and viewport. Also derive window to viewport transformation.(10 marks)

Write short notes on (any four)

7 (a) Colour models.(5 marks) 7 (b) Raster techniques.(5 marks) 7 (c) Display file interpreter.(5 marks) 7 (d) Fractals.(5 marks) 7 (e) 3D clipping.(5 marks)