MU Information Technology (Semester 5)
Computer Graphics & Virtual Reality
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) Explain Besenham's line drawing algorithm with suitable example.
10 M
1 (b) Explain bitmap and vector based graphics.
5 M
1 (c) Compare CMYK and RGB colour model.
5 M

2 (a) Explain sutherland-Hodgeman polygone clipping algorithm with suitable example.
10 M
2 (b) What are the different types of projections? Derive the matrix representation for perspective transformation in xy plane and on negative z axis.
10 M

3 (a) Compare mesh and features based wrapping method.
10 M
3 (b) Explain in detail any VR toolkit.
10 M

4 (a) Explain Flood Fill Algorithm using 8 connected approach. What are its advantages over Boundary Fill Algorithm.
10 M
4 (b) Derive mathemtical representation of Bezier curve. State their properties.
10 M

5 (a) Describe Halftoning, Thresholding and Dithering in detail with application in real world.
10 M
5 (b) Explain B-spline curve.
10 M

6 (a) What are different applications of computer graphics.
5 M
6 (b) Advantages of 3D morphing over 2D morphing.
5 M
6 (c) Explain even-odd method for inside test of polygon.
5 M
6 (d) Explain collision detection in VR.
5 M



More question papers from Computer Graphics & Virtual Reality
SPONSORED ADVERTISEMENTS