VTU Computer Science (Semester 6)
Computer Graphics and Visualization
December 2014
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) With a neat diagram, explain the graphics pipeline architecture.
10 M
1 (b) What are the openGL APIs for handling polygon types, colour attributes, viewing and aspect ratio?
6 M
1 (c) Briefly explain any two applications of computer graphics.
4 M

2 (a) What are the graphics functions which give good API support? Briefly explain each of them with example.
10 M
2 (b) What are the different approaches of colour in openGL? Explain with example.
10 M

3 (a) List the various features that a good inter active programs should include. Describe an open GL animating inter active program for the rotating square.
10 M
3 (b) Explain how an event driven input can be performed for window and keyboard events.
10 M

4 (a) Briefly explain the order in which-frame occurs in openGL pipeline.
8 M
4 (b) With respect to modelling of colour cube discuss:
i) Vertex array
ii) Bilinear interpolation
iii) Data structure for object representation.
12 M

5 (a) What are Affine transformation? Explain the basic transformation with respect to homogeneous co-ordinate system in 3D.
10 M
5 (b) What are Quaternion? With an example, explain how Quaternion are used in rotation in a 3D space. Give the mathematical representation of Quaternion.
10 M

6 (a) What are simple projections? Obtain perspective and orthogonal 4×4 matrix representation.
10 M
6 (b) Briefly explain different types of viewing with neat sketches.
10 M

7 (a) Explain the phong lighting model.
10 M
7 (b) Give the different classification of light material interactions. How are these supported in open GL?
10 M

8 (a) Explain the Cohen Sutherland line clipping algorithm and perform the clipping for line segment AB=[(-13,5)(17,11)], CD[(-2,3)(1,2)] against the window having lower left corner (-8, -4) and upper right corner at (12, 8).
10 M
8 (b) Explain the scan line polygon filling algorithm.
10 M



More question papers from Computer Graphics and Visualization
SPONSORED ADVERTISEMENTS