Computer Graphics - Dec 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) Illustrate inside outside test.(5 marks) 1 (b) Explain 3D display methods.(5 marks) 1 (c) What is z-buffer algorithm?(5 marks) 1 (d) Write a note on Fractals.(5 marks) 2 (a) What is a display file structure? Also explain the need for display file interpreter.(10 marks) 2 (b) Wrte a pseudo-code to implement boundary fill and flood fill algorithm using 4 connected method.(10 marks) 3 (a) Write an algorithm to fill polygon in fig (a) with pattern given in fig(b) of size m×n. (10 marks) 3 (b) Derive Bresenham's line drawing algorithm for lines with slope < 1.(5 marks) 3 (c) Write different applications of computer graphics.(5 marks) 4 (a) What do you mean by segment? What are the various attributes in segment table? State which operations can be on segments and explain the same.(10 marks) 4 (b) Derive the steps required to perform 3D rotation about arbitrary axis.(10 marks) 5 (a) Find the clipping Co-ordinates to clip the line segment PIP2 against the window ABCD using Cohen Sutherland line clipping algorithm.
P1(10, 30) P2(80, 90)
window ABCD A(20, 20) B(90, 20) C(90, 70) D(20, 70)(10 marks) 5 (b) What do you understand by terms parallel and perspective projection? Also explain depth cueing.(10 marks) 6 (a) Explain Gourad and Phong shading.(10 marks) 6 (b) Explain Bezier curves and Bezier surface with equations. Explain properties of Bezier curve.(10 marks)
Write short notes on (any four):-
7 (a) Animation(5 marks) 7 (b) Dithering techniques(5 marks) 7 (c) Warnock's algorithm(5 marks) 7 (d) Half toning(5 marks) 7 (e) Raster techniques(5 marks)