MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
May 2013
Total marks: --
Total time: --
INSTRUCTIONS
(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 the method to draw thick line using Bresenham's algorithm.
5 M
1 (b) Differentiate between image space and object space.
5 M
1 (c) What is aliasing? Explain some antialiasing techniques.
5 M
1 (d) Derive the transformation matrix to magnify the triangle A(0,0), B(1,2), C(3,2) to twice its size so that the point C(3,2 ) remains fixed.
5 M

2 (a) Explain Liang Barsky line clipping algorithm. Apply the algorithm to line with co-ordinates (30,60) and (60,25) against the window (Xmin, Ymin) = (10,10) and (Xmax, Ymax) = (50,50).
10 M
2 (b) Explain parallel and perspective projection. Perform perspective projection of unit cube when the centre projection is at Xc=10, Yc=10 on to z=0 plane.
10 M

3 (a) Derive the composite matrix for reflection of an object about a line y=mx+c. Apply the derived matrix for the object A(4,2) , B(5,3), C(6,2) and D(7,1) on the line y=2x.
10 M
3 (b) Derive the midpoint algorithm for ellipse generation.
10 M

4 (a) Explain Weiber-Atherton algorithm for polygon clipping. What are its advantages over other polygon clipping algorithms?
10 M
4 (b) Explain the different Raster techniques and the transformation associated with it.
10 M

5 (a) Explain Painter's algorithm.
10 M
10 M

6 (a) Explain computer assisted animation and frame by frame animation.
10 M
6 (b) Explain scan line fill algorithm with suitable example.
10 M

7 (a) Explain RGB and CMY colour models.
10 M
7 (b) State the properties of Bezier curves. How a Bezier surface be generated from a Bezier curve?
10 M

More question papers from Computer Graphics