Code No: 221402 II B.Tech.

II-Semester Supplementary Examinations, November-2003 COMPUTER GRAPHICS (Mechatronics) Time: 3 hours Answer any FIVE questions All questions carry equal marks --1. Write short notes on: Max. Marks: 80

Set No.

1

a) Liquid crystal displays b) Raster scan display system 2.a) b) 3. 4. 5. 6. 7. 8.a) b) c) Explain the role of display interpreter in graphical display with a block diagram. What is meant by normalized device co-ordinate system. What are its advantage? Explain with suitable examples different 2-dimensional techniques. Derive their respective matrix representations. transformation

What are the various operations to be performed on the segments? Discuss various data structures that can be used for storing segments in the display files. Explain the Cohen-Sutherland algorithm for finding the category of a line segment. Show clearly how each category is handled by the algorithm. Explain briefly the transformation steps for obtaining a composite matrix for rotation about an arbitrary axis with the rotation axis projected on to the z-axis. Outline the z-buffer algorithm. List the advantages and disadvantages of the z-buffer algorithm. What are the advantages of B-splines over Bezier curves? Differentiate between interpolation and approximation representations. Give the applications of raster scan graphics. -*-*-*in spline

Code No: 221402 II B.Tech. II-Semester Supplementary Examinations, November-2003 COMPUTER GRAPHICS (Mechatronics) Time: 3 hours Answer any FIVE questions All questions carry equal marks --1.a) b) 2.a) b) 3.a) b) 4. Max. Marks: 80

Set No.

2

Explain the concepts of aliasing and antialiasing. How can the effects of aliasing be minimized? Write short notes on frame buffer. Using the syntax of display file structure, write the algorithm to put an instruction into the display file. Explain the role of display file in the graphical image generation. How the magnification and reduction of the graphical objects is done. Derive the composite transformation matrix which magnifies an object by ‘s’ units in x and y directions about its center c(h,k). Derive the window-to-viewport transformation equations by first scaling the window to the size of the viewport and then translating the scaled window to the viewport position. Explain the working of the Sutherland - Hodgeman algorithm for polygonal clipping with the help of suitable example. Write 3-dimentional homogeneous matrix to rotate by Π degrees about the line passing through the point (0,0,0) and (1,0,1) Write a note on smooth shading. Write about the following: a) 3D clipping b) Shading algorithms Describe Bezier surface generation technique with examples. -*-*-*-

5. 6.a) b) 7.

8.

Code No: 221402 II B.Tech. II-Semester Supplementary Examinations, November-2003 COMPUTER GRAPHICS (Mechatronics) Time: 3 hours Max. Marks: 80 Answer any FIVE questions All questions carry equal marks --1. 2. 3. 4. 5. Explain briefly about various display devices used in computer graphics. Explain the scan-line algorithm for polygon filling.

Set No.

3

Show how reflections in the line y = x and in the line y = -x can be performed by a scaling operation followed by a rotation (scaling by negative factors permitted). Find the normalization transformation N that uses the rectangle A (1,1), B (5,3), C (4,5) and D (0,3) as a window and the normalized device screen as a viewport. Explain the following: a) Generalised clipping b) Multiple windowing. Explain about the following 3D transformations: a) Scaling b) Translation c) Rotation about x-axis. Explain the basic conepts of hidden surfaces and line removal methods with suitale examples. Write about z-buffers. Write about the following: a) Generation of curves and surfaces. b) Sweeping method of interpolation. -*-*-*-

6.

7.a) b) 8.

Code No: 221402 II B.Tech. II-Semester Supplementary Examinations, November-2003 COMPUTER GRAPHICS (Mechatronics) Time: 3 hours Answer any FIVE questions All questions carry equal marks --1. 2.a) b) 3.a) b) 4. 5. Write an algorithm for circle generation given center and radius. Write an algorithm for polygon generation. Explain about pattern filling. Max. Marks: 80

Set No.

4

Prove that the scaling transformations commute; that is, S1 × S2 = S2 × S1. Prove that the 2-D rotations about the origin commute; that is, R1 × R2 = R2 ×R1. Write procedures for creating and closing segments. Explain the following: a) Cohen-Sutherland line clipping b) Multiple windowing Derive transformation matrices for a) Parallel projection b) Perspectie projection. Write about the following: a) Gourand shading b) Painter’s algorithm. Explain various methods for generation of curves and surfaces. -*-*-*-

6.

7.

8.

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.