Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
5 views

Computer Graphics Question Paper

5th semester computer graphics

Uploaded by

Ashni Suresh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
5 views

Computer Graphics Question Paper

5th semester computer graphics

Uploaded by

Ashni Suresh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
BIS-V(15}11.17-1548 Reg. No. | [ ] ( B.Tech. Degree V Semester Examination November 2017 CS 15-1506 COMPUTER GRAPHICS (2015 Scheme) Time : 3 Hours ‘Maximum Marks : 60 I mL, IV. PART A (Answer ALL questions) (10 x2 = 20) (@)_ Write any two methods for antialiasing. (b) Discuss the contents of sorted edge table (SET) in scanline fill algorithm, (©) Write homogeneous matrices for rotating a point about a reference point in 2D. @ (©) Give the steps involved in reflection about x x-axi (How is visible surface detection performed in backface detection method? (g) What are the factors on which the final projected point depend in perspective projection? (h) What is specular reflection? Write one illumination model for specular reflection. (i) Discuss different types of fractals. Give one example for each type. Discuss important animation techniques. four properties of Bezier curve. Compare Bezier splines and B-splines. line in terms of reflection about PART B (4x10 = 40) (a) Explain DDA line drawing algorithm. 6) (b) Find the points in the line A(10, 5) B(14, 15) using DA. @) OR (a) Describe midpoint circle drawing algorithm. © (b) _ Find the points in a circle with center (10, 8) and radius = 4. @ (a) Discuss the different methods for text clipping with example. @) () Give the final clipped line end points using Cohen Sutherland algorithm for the (7) line A (5,3) B(12, 8) against the window with boundaries (0,0) and (10, 20). OR @1.0) VI. Vi vin. Ix. (a) (b) (a) (b) (a) (b) (a) (b) (a) b) Explain window to viewport transformation, Transform the point (20, 40) in the window with boundaries (10,10) and (50, 50) to the viewport (100, 100) and (200, 300).. Describe the steps in clipping the polygon shown below using Sutherland Hodgeman Polygon algorithm. A q Write the vertex table, edge table and surface table for a cube with side 3 units and placed with one vertex at the origin. Discuss A-buffer method for hidden surface of A-buffer over Z-buffer? ination. What is the advantage OR Explain octree tree hidden surface elimination method. How can we determine whether a polygon is: (i) inside completely? (ii) outside completely? overlapping? (iv) surrounding a rectangular boundary, in area subdivision algorithm? Explain ray tracing. Explain texture mapping. OR Explain surface rendering, Discuss any two colour models. a ©) (6) () (6) a) 6) a ©) @)

You might also like