MORE IN Computer Graphics
MU Computer Engineering (Semester 4)
Computer Graphics
May 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) What are aliasing and antialiasing? Explain any one antialiasing method.
5 M
1 (b) What are the disadvantages of DDA algorithm?
5 M
1 (c) What is viewing tranformation?
5 M
1 (d) Define Shearing and give example.
5 M

2 (a) Explain the midpoint circle generating algorithm.
8 M
2 (b) Explain the steps used in rotation of 2-D object about an arbitrary axis and derive the matrices of same.
12 M

3 (a) Explain Liang-Barsky line clipping algorithm with suitable example.
10 M
3 (b) Explain Sutherland-Hodgeman polygon Clipping algorithm in detail.
10 M

4 (a) What are Parallel and Perspective projection and derive the matrix for perspective projection.
10 M
4 (b) Explain the properties of Bezier curves.
10 M

5 (a) What is the use of Scan line method and explain all the steps.
10 M
5 (b) Define Koch curve? How do you construct the Koch curve?
10 M

Write short note on any four:
6 (a) Open CI.
5 M
6 (b) Area subdivision method.
5 M
6 (c) Composite transmformation
5 M
6 (d) Sweep representations.
5 M
6 (e) Flood fill algorithm.
5 M

More question papers from Computer Graphics