MU Computer Engineering (Semester 4)
Computer Graphics
May 2014
Total marks: --
Total time: --
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary

1(a) Explain Bresenhams line drawing algorithms.plot a line by using Bresenhams line generating algorithm from(1,1) to (5,3)
10 M

Define window, view port and derive window to view port transformation.

10 M

2(a) Explain parallel and perspective projection and derive the matrix for perspective projection.
10 M
2(b) Specify mid point circle algorithms.using the same,plot the circle whose radius is 10units
10 M

3(a) Explain Gouraud and phong shading along with their advantages and disadvantages.
10 M
3(b) Explain scan line fill algorithm with an example
10 M


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)

10 M
4(b) Explain any one polygon clipping algorithm
10 M

5(a) Derive the matrix for 2D rotation about an arbitrary point.
10 M
5(b) Explain Bezier curve and also specify the properties of Bezier curve.
10 M

Answer any two
6(a) Write a short notes on any two
half toning and dithering techniques.
10 M
6(b) Raster techniques
10 M
6(c) Describe the following 3-D representation method:
i) sweep representation
ii) B-REF
iii) CSG
10 M

More question papers from Computer Graphics