MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
December 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 character generation methods.
5 M
1 (b) Explain inside outside test used in polygon filling.
5 M
1 (c) What is antialiasing? How it can be reduced?
5 M
1 (d) Explain z-buffer algorithm for removing hidden surface.
5 M

2 (a) Explain flood fill algorithm using 8 connected approach. Give its advantages and disadvantages.
10 M
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 M

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 M
3 (b) List and explain operations on segment.
10 M

4 (a) Find the clipping coordinate to clip the line segment AB against the window using Cohen-Sutherland line clipping algorithm.
10 M
4 (b) Explain Warnock's algorithm.
10 M

5 (a) State important properties of Bezier curve. Compare Bezier curve and B-spline curve.
10 M
5 (b) Explain parallel and prospective projection. Derive matrix for perspective projection.
10 M

6 (a) Explain 3D object representation methods.
10 M
6 (b) Define window and viewport. Also derive window to viewport transformation.
10 M

Write short notes on (any four)
7 (a) Colour models.
5 M
7 (b) Raster techniques.
5 M
7 (c) Display file interpreter.
5 M
7 (d) Fractals.
5 M
7 (e) 3D clipping.
5 M

More question papers from Computer Graphics