Computer Graphics - May 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 Bresenhams line drawing algorithms.plot a line by using Bresenhams line generating algorithm from(1,1) to (5,3)(10 marks) 1(b)
Define window, view port and derive window to view port transformation.(10 marks) 2(a) Explain parallel and perspective projection and derive the matrix for perspective projection.(10 marks) 2(b) Specify mid point circle algorithms.using the same,plot the circle whose radius is 10units(10 marks) 3(a) Explain Gouraud and phong shading along with their advantages and disadvantages.(10 marks) 3(b) Explain scan line fill algorithm with an example(10 marks) 4(a)
Explain Liang Barsky line clipping algorithms. Apply this algorithm to the line with coordinates (30,60) and (60,25) against the window
(Xmin,Ymin)=(10,10) and (X max, Ymax)=(50,50)
Answer any two
6(a) Write a short notes on any two
half toning and dithering techniques.(10 marks) 6(b) Raster techniques(10 marks) 6(c) Describe the following 3-D representation method:
i) sweep representation
iii) CSG (10 marks)