Birla Institute of Technology and Science-Pilani, Hyderabad Campus

First Semester 2015-2016

Comprehensive Exam PART-B
Course No: IS F311 Course Title: Computer Graphics
Type: Closed Total Time: 3 hrs Total Marks: 50 Date: 14/12/15

1. Attempt all questions. Try to attempt them in sequence.

2. Write neatly and do not skip steps.

3. Calculator is allowed.

4. Make sure that there are two pages to this question paper.

Q1 [6] Describe the midpoint line drawing algorithm for lines with slopes |m| < 1. Discuss how the initial
value of the decision variable is decided and how it is updated?
Q2 [6] Discuss the steps of Weiler Artherton’s polygon clipping algorithm using an example. Make sure
you use a non-convex polygon whose resultant output is multiple pieces of polygon as an
example.
Q3 [1+5]

1. Find the transformation matrix for mirror reflection of a point in three dimensions about XY -plane.

2. Find the transformation matrix for mirror reflection with respect to the plane passing through
origin and having a normal vector whose direction is N = î + ĵ + k̂.

Q4 [8] Compute parallel projection of a triangle ABC with coordinates A(1, 0.5, 1), B(0.5, 1, 1), C(1, 1, 0.5)
on a view plane passing through the point P0 (10, 0, 5) and having view plane normal OP0 . The direction
of the projection is parallel to view plane normal.
Q5[6] Describe in details the Warnock’s area subdivision algorithm for visible surface determination.
Make sure you describe all the tests in details.
Q6[3+3]

1. William is trying to make a polyhedral approximate model M of the sphere. He decides to use only
quadrilaterals and each vertex of M will have exactly four quadrilateral faces incidnet on it. In case
he makes such a model

(a) What will be the relationship between number of vertices and number of edges?
(b) What will be the relationship between number of faces and number of edges?
(c) Will he be able to make such an M? If not why?

2. Consider the figure 1. Draw the octree representation of the shaded polygon. Use the convention
that first leaf from left is 2nd quadrant, second leaf is 1st quadrant, third leaf is 3rd quadrant, and
fourth leaf is 4th quadrant.

Q7[6] It is often necessary to retain a portion of the parametric cubic curve. This is expedited by
transforming the parametric variables in such a way that the new parametric interval also runs from 0 to
1. So lets say P (u) is the our curve as shown in figure 2 and we are interested in the parametric interval
[ui , uj ]. We want to reparameterize this portion using a new parameter v going from 0 to 1. Assume that

1
 Figure 1: Make Octree for the shaded polygon

the relation between two parameter is v = au + b because otherwise the degree of the curve will change.
If
U = u3 u2 u 1

and
v3 v2 v 1


V =
. Find the matrix T such that U = V T . Use the notation uj − ui = ∆ui .

Figure 2: Reparametrize cubic curve

Q8[6] Assume that at point P on the surface the normal, light and view vectors are ~n = ĵ, L~ = −î+2ĵ − k̂,
~ = î + 1.5ĵ + 0.5k̂. Assuming that there is only one object in the scene. The light source is assumed
and V
to be 10 times more intense than the ambient light i.e. Ia = 1 and Il = 10. The surface is to have a shiny
metallic appearance, hence most of the light is specularly reflected. Thus assume specular coefficient
ks = 0.8, diffuse coefficient and ambient coeffcient ka = kd = 0.15, and specular reflection paramter
ns = 5. Determine the total intensity value at P . Please note that intensity has only one component and
do not assume that the intensity value is normalized from 0 to 1. Show all the steps of the calculation.