Code No: R5311902 1

III B.Tech I Semester(R05) Supplementary Examinations, May 2009

COMPUTER GRAPHICS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) How much time is spent in scanning across each row of pixels during screen refresh on a
raster system with a resolution of 1280 by 1024 and a refresh rate of 60 frames per second.
Assume horizontal and vertical retrace times are negligible.
(b) Discuss about the applications of computer graphics in the area of image processing.
[10+6]

2. (a) Write Bresenham’s algorithm for line generation which is suitable for any slope.
(b) Using the above algorithm, generate the intermediate points of the line segment, if the
two end-points are given as (30,18) and (20,10). [8+8]

3. (a) Derive the transformation matrix for rotation about origin.

(b) Explain the terms: [8+8]
i. Homogeneous Coordinates
ii. Rigid-body transformations
iii. Composite transformations.

4. (a) Give a brief note about two dimensional viewing functions. Give an example which uses
two dimensional viewing functions.
(b) Explain the Cohen-Sutherland line clipping algorithm. [8+8]

5. Explain the procedure to design two-dimensional cubic-Bezier curve shapes that have second
order piece-wise continuity. [16]

6. Prove that the multiplication of three-dimensional transformation matrices for each of the
following sequence of operations is commutative.

(a) Any two successive translations

(b) Any two successive saling operations
(c) Any two successive rotations about any one of the coordinate axes. [16]

7. (a) Distinguish between object-space and image space methods of visible surface detection
algorithms. Give examples for each.
(b) Given points P (1, 2, 0), P (3, 6, 20) P (2, 4, 6) and a view point C (0, 0, -10), determine
which points obscure the others when viewed from C. [8+8]

8. What are the issues involved in design of a story board layout with accompanying key frames
for an animation of a single polyhedron. [16]

?????
Code No: R5311902 2
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
COMPUTER GRAPHICS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Consider a non interlaced raster monitor with a resolution of n by m (m scan lines and
n pixels per scan line), a refresh rate of r frames per second, a horizontal retrace time of
t horiz and vertical retrace time of tvert. What is the fraction of total refresh time per
frame spent in retrace of the electron beam.
(b) Explain the applications for large-screen displays. What graphical output devices support
it? [12+4]

2. (a) Explain the DDA scan conversion algorithm for generating the points on line segment,
when two end-points are given as input.
(b) Digitize the line with end-points (20,10) and (30,18) using DDA algorithm.
[8+8]

3. Show that the transformation matrix for a reflection about the line y=x is equivalent to a
reflection relative to the x axis followed by a counter clockwise rotation of 900 .
[16]

4. (a) What are the steps involved in Sutherland-Hodgeman algorithm.

(b) What are the advantages and disadvantages of Sutherland - Hodgeman algorithm. [12+4]

5. (a) Define the Bazier geometry vector (GB ).

(b) How the Bazier geometry vector (GB ) and the Bazier basis matrix are related.
[8+8]

6. Find a transformation Av which aligns a given vector V with the vector K along the positive
z-axis. [16]

7. (a) Explain the possible relationships between polygon surfaces while implementing area-
subdivision method. How to handle these cases.
(b) Illustrate with an example a scence consisting of three or more planes and explain how
the BSP tree is constructed to represent the scene. [8+8]

8. (a) How the morphing effects are implemented in key frame system bared animation lan-
guages?
(b) Explain how the kinematic description are simulated in key frame systems.
[8+8]

?????
Code No: R5311902 3
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
COMPUTER GRAPHICS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) What is the fraction of the total time per frame spent in retrace of electron beam for a
non-interfaced raster system with a resolution of 1280 by 1024, a refresh rate of 60 Hz, a
horizontal retrace time of 5 micro seconds and a vertical retrace time of 500 micro seconds.
(b) Explain the architecture of a simple random scan system. [10+6]

2. (a) Use the mid-point method to derive a decision parameter for generating points along a
straight line path with slope in the range 0 <m <1.
(b) Use the mid-point method and symmetry considerations propose a solution to scan convert
the parabola. x=y 2 for the interval - 10 ≤ y ≤10. [8+8]

3. (a) Express as a composite transformation matrix, the transformation which magnifies an

object about its center C (h,k). by s units in each direction.
(b) Derive the transformation that rotates an object point θ about the origin. Write the
matrix representation for their rotation. [8+8]

4. (a) What are the steps involved in Sutherland-Hodgeman algorithm.

(b) What are the advantages and disadvantages of Sutherland - Hodgeman algorithm. [12+4]

5. Determine the quadratic Bezier blending functions for three control points. Plot each function
and label the maximum and minimum values. [16]

6. Given a unit cube with one corner at (0, 0, 0) and the opposite corner at (1, 1, 1), derive the
transformations necessary to rotate the cube by θ degrees about the main diagonal (from (0, 0,
0) to (1, 1, 1) in the counter clock-wise direction when looking along the diagonal toward the
origin. [16]

7. (a) Illustrate the procedure for implementing area-sub division method.

(b) Explain how the BSP-tree method is implemented for visible surface detection.
[8+8]

8. What are the steps in design of animation sequence? Describe about each step briefly. [16]

?????
Code No: R5311902 4
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
COMPUTER GRAPHICS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Distinguish the operating charactersitcs of raster refresh systems and vector refresh sys-
tems.
(b) Explain the functioning of LCDs. What are its advantages? [8+8]

2. (a) Implement the line-type function by modifying Breshenham’s line drawing algorithm to
display either solid, dashed or dotted lines.
(b) Modify the mid-point algorithm for scan converting lines to write pixels with varying
intensity as a function of line slope. [8+8]

3. (a) What is the general form of the matrix for rotation about a point P(h,k).
(b) Perform a 450 rotation of a triangle A(0,0), B(1,1) and C(5,2) about the origin.
[8+8]

4. (a) Explain how to determine whether a polygon vertex is inside or outside the window edge.
What is the significance of this routine in determining whether a polygon edge intersects
the window edge.
(b) Justify that the Sutherland - Hodgeman algorithm is not suitable for clipping when the
clipping polygon is a concave window. [8+8]

5. (a) Describe the phong illumination model. Explain the parameters used in phong’s model.
(b) List and explain the problems with interpolated shading methods. [8+8]

6. (a) What is the procedure for reflecting an about an arbitrarily selected plane.
(b) What are the characterstics of perspective projections? [8+8]

7. Write an algorithm for generating a quad tree representation for the visible surfaces of an object
by applying the area subdivision tests to determine the values of the quad tree elements. [16]

8. (a) Explain how the simple animation effects are achieved by look-up table entries.
(b) Give a brief note about graphical languages for animation. [8+8]

?????