MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
December 2015
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) State what is meant by clipping. Explain any one clipping algorithm.
5 M
1 (b) Explain flood fill algorithm in detail.
5 M
1 (c) Differentiate between random scan and raster scan technique.
5 M
1 (d) Explain the various colour models in detail.
5 M

2 (a) Define window and viewpoint. Derive window to viewport transformation.
10 M
2 (b) Explain what is meant by Bezier curve. Also explain how a Bezier surface can be generated from Bezier curve.
10 M

3 (a) What is meant by parallel and perspective projections? Derive the matrix for perspective projections.
10 M
3 (b) Explain the steps used in rotation of 2D object about an arbitrary axis and hence derive the matrix for the same.
10 M

4 (a) Explain midpoint circle algorithm. Explain the same to plot a circle whose radius is 10 units.
10 M
4 (b) Explain half toning and dithering techniques in detail.
10 M

5 (a) Derive Bressenhams line drawing algorithm for lines with slope < 1.
10 M
5 (b) Explain Gourand and Phong shading techniques in detail.
10 M

Write short notes on: (any two)
6 (a) Polygon clipping method.
10 M
6 (b) OpenGL
10 M
6 (c) Sweep representations.
10 M

More question papers from Computer Graphics