VTU Computer Science (Semester 6)
Computer Graphics and Visualization
December 2013
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) Briefly explain the applications of computer graphics.
8 M
1 (b) Explain the process of image formation with pinhole camera as an example. Derive the expression for angle of view.
12 M

2 (a) Write an openGL recursive program for 3D Sierpinski gasket with relevant comments.
12 M
2 (b) Explain the seven major groups of functions of a good API.
8 M

3 (a) Enlist the features of good interactive program.
6 M
3 (b) How pop-up means are created using GLUT? Illustrate with an example.
10 M
3 (c) What is double buffering? Explain the advantages of double buffering.
4 M

4 (a) What are vertex arrays? Show how vertex arrays can be used to represent a cube in openGL.
10 M
4 (b) A square in a two dimensional system is specified by its vertices (6,6) (10, 6) (10, 10) and (6, 10). implement the following by its first finding a composite transformation matrix for the sequence of transformation.
i) Rotate the square by 45° about its vertex (6, 6)
ii) Scale the original square by a factor of 2 about its centre.
10 M

5 (a) Obtain the matrix representation for rotation of a point about an arbitrary axis in it 3D space.
10 M
5 (b) Show that the following three dimensional sequence are commute.
i) A rotation and a uniform scaling.
ii) Two rotations about the same axis.
10 M

6 (a) Briefly explain the perspective and parallel views in lopenGL. Give example.
10 M
6 (b) What is mesh? With example explain how meshes are generated.
10 M

7 (a) Describe the phong lighting model. What are its advantages?
10 M
7 (b) Briefly explain the different types of light sources supported openGL.
10 M

8 (a) Use Liang Barsky line clipping algorithm to clip a line from starting point (30, 15) and ending point (65, 35) against the window having its lower left corner at (40, 10) and upper right corner at (75, 25).
10 M
8 (b) Use Bresenham's line algorithm to digitalize a line from point (0,0) to point (6,4).
10 M



More question papers from Computer Graphics and Visualization
SPONSORED ADVERTISEMENTS