MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
December 2014
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 8 connected flood fill algorithm in detail.
5 M
1 (b) Differentiate between random scan and raster scan techniques.
5 M
1 (c) Explain Liang Barsky line clipping algorithm in detail.
10 M

2 (a) Derive Bressenham's line drawing algorithm for lines with slope <1
10 M
2 (b) Explain parallel and perspective projection and derive the matrix for perspective projection.
10 M

3 (a) Derive the matrix for 2D rotation about an arbitary point.
10 M
10 M

4 (a) Explain midpoint circle algorithm. Use the same to plot the circle, whose radius is 10 units.
10 M
4 (b) Explain any one polygon clipping method in detail.
10 M

5 (a)

Define window, viewport and hence derive window to viewport transformation.

10 M
5 (b) Explain what is meant by Bezier curve. State its properties and hence explain how a Bezier surface can be generated from Bazier curve.
10 M

6 (b) Open GL basic primitives
10 M
6 (c) Sweep representation
10 M
Write short notes on any two following:-
6(a) Half toning and dithering techniques.
10 M

More question papers from Computer Graphics