How To Exam?

a knowledge trading engine...


Anna University Chennai 2005 B.E Computer Science COMPUTER GRAPHICS - Question Paper

Monday, 25 February 2013 02:25Web
Q.2 a. Explain the working of a joystick. (5)

b. Using Cyrus-Beck line clipping algorithm, clip the line passing through the point (10, 30) and parallel to the line y = two x for a triangular window ABCA described by :
A = (0, 0), B = (10, 0) and C = (0, 20). (9)

Q.3 a. Give an example of a non-uniform, non-periodic B-spline curve of order 3. Justify the ans. (5)

b. State Bresenham circle generation algorithm. Using the algorithm draw the arc of the circle with centre at origin lying in the fourth quadrant. (9)

Q.4 a. Consider the orthographic parallel projection on the plane
x - y + z = 0
obtain the matrix of projection transformation? Is it an isometric projection? Justify your ans. (8)

b. Describe the method of obtaining the combined effect of diffused and specular light reflection model. (6)

Q.5 a. An object is being viewed from (50, 0, 10). obtain the matrix transformation to perform the projection of any provided point on the YZ-plane. (8)

b. Develop a 2D transformation matrix to get mirror reflection of objects in a mirror passing through origin and making with x - axis. (6)

Q.6 a. Explain Sutherland-Cohen method of line clipping. (7)

b. What is morphing? If 2 keyframes are given, how will you simulate morphing ranging from the 2 frames with uniform speed in the beginning followed by increase in speed? (7)
PART II
ans any 3 ques.. every ques. carries 14 marks.
Q.7 a. Describe Phong-shading model. elaborate its advantages over Gouraud shading model? discuss using an illumination model. (9)

b. Explain how can self hidden faces be removed? (5)

Q.8 a. What is CSG model? discuss how is such a representation scheme useful for modelling three D objects? State its advantages and disadvantages over B-rep scheme. (7)

b. Explain depth-sort algorithm for hidden surface removal. (7)

Q.9 a. Describe scan-line seed fill algorithm. elaborate its advantages and disadvantages over other seed fill algorithms? (8)

b. What are self squaring fractals? provide an example. Write an algorithm to generate this fractal. (6)


where I, j and k are unit vectors in the X-, Y- and Z- directions respectively.
Q.10 a. What is half-toning? State its usefulness in computer graphics. (5)

b. A cubic Bezier curve is described by the control points :

Suppose it is desired to join this curve at P4 with a different Bezier curve, which has control points:
with C(1) - continuity joining.
Work out the coordinates of points q1 and q2. Draw rough sketch of both the curves. (9)

Q.11 a. What is a BSP tree? What is the criterion of choosing the root of this tree? (4)

b. The torus has a circular cross part. Show how to generate this solid object as surface of revolution. (4)

c. Describe the different components for the creation of an animation sequence. (6)






d. Suppose a rectangular window has its least corner at (-2, -1) and its upper right corner at (3, 2). If the bit codes of the region is assigned as

bit one : left
bit two : right
bit three : beneath
bit four : above
then the logical intersection of the bit codes of the end points of the line segment having end points (-3, 1) and (1, 3) is
(A) 0000. (B) 1000.
(C) 0001. (D) 1010.
1
Index Next>>




( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Anna University Chennai 2005 B.E Computer Science COMPUTER GRAPHICS - Question Paper