Birla Institute of Technology and Science-Pilani

Hyderabad Campus
First Semester 2015-2016
Comprehensive Exam PART-A
Course No: IS F311 Course Title: Computer Graphics
Type: Closed Total Time: 3 hrs Total Marks: 30
Date: 14/12/15
ID: Name:

1. Write the answers in the space provided on the question paper.

2. Overwriting or unreadable handwriting gets no credit. Write neatly.
3. Make sure that there are four pages to this question paper.
4. Budget your time as there is another part following this question paper.
5. Assume Right handed coordinate system for all the questions.

Q1 [30] Fill in the blanks

1. The number of bits required for a 512 × 512 raster display with each pixel being represented
by 3 bits are . [1]

2. The persistence of phosphor is defined as

. [1]

3. The task of a video controller is

. [1]

4. is the inventor of mouse. [1]

5. The homogeneous coordinate representation of a vector from point p0 (0, 1, 0) to p1 (5, 2, 5) is

. [1]

6. An object is defined with respect to a 2D coordinate system whose units are measured in
feet. If an observer’s 2D coordinate system uses inches as the basic unit, the coordinate
transformation used to describe object coordinates in the observer’s coordinate system is [1]

 

T =
 


1
 7. The general form of a uniform scaling matrix in 2D with respect to a fixed point P (h, k),
where scaling factor is s, is given by [2]

 
 
 
T =



 
0 0 1

8. Consider Cohen-Sutherland line clipping algorithm. Assume that xmin = 1, xmax = 4, ymin =
1, ymax = 4 be the clip window. Assume outcodes are given in (T op, Bottom, Right, Lef t)
order. Consider four point A(0, 2) , B(2, 5), C(5, 7). and D(5, 3). There are two line segments
AB and CD. The outcodes of A, B, C, and D are and
respectively. Now as per the algorithm the line will be trivially rejected
because [4]

9. and are two kinds of oblique projection. [1]

10. Assume in the perspective projection the projection plane is normal to the z−axis at z = d.
The perspective projection P 0 (X, Y, Z, W ) of the point P (x, y, z, 1) is given by [1]

    
 X   1 0 0  x 
    
 Y   0 1 0  y 
=
    
  
 Z   0 0 1  z 
    
    
W 1

11. Consider a parametric cubic curve P (t) which passes through P1 , P2 , P3 , P4 at parametric
values 0, 31 , 23 , 1. Give the matrix representation of P (t) = T M B where [4]

  
   P1 
 

 
  P2 
P (t) = t3 t2
  
t 1   
  P 
  3 
  
P4

12. As per Requicha’s and are

two among many of the properties desirable in a solid representation. [1]

2
13. A generalization of Euler’s formula applied to 2-manifold that have faces with holes is
. [1]

14. The main advantage of Octrees over spatial-occupancy enumeration is

.[1]

15. and approaches/representation guar-

antees the uniqueness of a solid representation. [1]

16. Consider making a BSP tree for the arrangement of line segments as shown in figure 1.
Assume that auto partition is used i.e. the supporting line of line segments are used for
partitioning. Let the line segments be processed in the order (1,3,4,2). The total number of
nodes in the BSP tree is . Do not include empty nodes in your counting. [2]

Figure 1: Make BSP Tree

17. Assume Ax + By + Cz + d = 0 is the plane equation of a surface for which we are computing
depth values. In Z buffer algorithm, if the depth of position (x, y) has been determined to
be z, then the depth z 0 of the next position (x+1, y) along the scan line y can be incrementally
updated using formula . [1]

18. In A-Buffer algorithm, accumulation buffer has two field; namely depth field and intensity
field. If the depth field is negative, it means
. [1]

19. If a scene contains , then all

hidden surfaces are identified with the back-face detection method. [1]

20. If a point P1 on scan line 5 has an RGB color (1, 0.5, 0) and point P2 is on scan line 15 has an
RGB color (0.2, 0.5, 0.6), the color for scan line 8 on the line P1 P2 using Gouraud’s shading
model is . [1.5]

3
 √ √
21. Consider the figure 2 . Assume we are using Phong’s shading model. If N 0 = − 2
2
î + 2
2
ĵ
√ √
and N 00 = − 2
2
î + 2
2
k̂. Assume point p is half way between p0 and p00 . The unit normal
vector N at p is given by . [1.5]

Figure 2: Apply Phong shading

Total Marks : Signature:

END OF PART-A
SUBMIT BEFORE COLLECTING PART-B