MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
May 2012
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) What are applications of computer graphics.
5 M
1 (b) Explain frame by frame animation.
5 M
1 (c) Explain Ray Tracing.
5 M
1 (d) Explain antialiasing techniques.
5 M

2 (a) Write Bresenham's line drawing algorithm also write mathematical derivations for the same.
10 M
2 (b) Explain 4-connected and 8-connected methods. Also explain flood fill and boundary fill algorithms.
10 M

3 (a) What is segment? Explain segment table and any 4 operations which can be performed on segments.
10 M
3 (b) Explain Liang Barsky line clipping algorithm.
10 M

4 (a) Explain Sutherland-Hodgeman polygon clipping algorithm. How Welier-Athorton algorithm solves the problem of concave polygon clipping?
12 M
4 (b) Describe HSV and RGB color model.
8 M

5 (a) Explain the rotation of an object about an arbitrary point. Derive composite matrix for the same.
10 M
5 (b) Describe 3D clipping of an object.
10 M

6 (a) Explain Painter's algorithm.
10 M
6 (b) Explain Bezier curve and write properties of Bezier curve.
10 M

7 (a) Explain and compare Phong Shading and Gouraud Shading.
10 M
7 (b) Describe Diffuse Illumination and Point-source Illumination.
10 M

More question papers from Computer Graphics