2022 Dec Computer Graphics PDF

71 7...

71 7 F3 15 C5 15 Paper / Subject Code: 50925 / Computer Graphics EA 3A 52 7D ED F3 15 C5 15 D5 EA 3A 52 7D ED 27 F3 15 C5 15 D5 6B 3A 2 7D ED 35 27 45 C5 15 F 5 6B 7E A D 7D ED 3 27 DB 5 (3 Hours) Total Marks: 80 C5 4 5 AF 5 6B E D1 D 71 D 7 53 7 B 45 57 5E EA B2 D C 7E N.B: 1. Question No. 1 is compulsory D1 7D 1 7D 15 6 7 B 5 2. Attempt any 3 from remaining questions E EA B2 52 4 15 D 5 E 7D 71 3. Assume any suitable data if necessary and justify the assumptions F3 15 B7 6 D 45 E A 3A 2 2 D 5 6B 35 E E D1 D 1 5 7 C5 A7 F 27 1 B 45 5E Q.1 Attempt any Four. 20 A 2 1D 7D B 5 5E E 3 7D 3 B7 56 C5 A7 15 AF 21 a) Give difference between random scan display and raster scan display. B2 E4 1D 7D ED 5 E 3 F3 5 B7 56 5 A7 15 21 D5 C b) Define Aliasing, Describe different antialiasing techniques. A E4 1D 7D D 6B 5 E 53 27 3 E 5 7 A7 15 AF 1 D5 DB 45 c) Compare DDA and BRESENHAM line drawing algorithm. C 6B 2 D D 35 E 7E 53 27 45 71 7 E 15 5 F d) Explain point clipping algorithm. 5 DB C B 7E EA D1 A 2 7D D 56 5 3 DB 71 57 3 5E 15 C5 B2 4 e) Give fractal dimension for KOCH curve. AF 7E EA 1 2 7D 71 D 6.in D 35 53 DB 5 7 E EA 15 B2 4 15 AF D5 C 7E 52 71 7D 15 56 ED 3 27 B F3 EA C5 Q.2 a) Derive formula for mid-point circle algorithm. 10 52 4 15 D 5 6B E 3A D 71 F3 7D 15 B7 D es 27 5 E A b) Given a line AB where A(3,1) and B(0,0) calculate all the points of line AB using 10 C5 3A 52 4 15 1D D5 6B E E F3 7D 15 7 5 D 7 7 DB 45 DC DDA algorithm. E A 3A B2 52 15 5 5E 7E 7D 71 57 F3 ot 56 5 ED 21 B DC A D1 3A B2 E4 D D5 5 E 71 57 F3 5E 15 B7 56 C5 Q.3 a) With neat diagram explain Composite transformation. 27 10 A D1 A 2 7D 4 1D 7D un 6B 5 E 7E 3 3 5E 15 C5 2 b) Describe what is Homogeneous coordinates. 10 A7 15 F DB 45 6B A 52 7D 7D ED 5E 7E 53 45 71 F3 B2 15 21 5 DB C E EA A 7D D B7 56 ED 35 3 m 71 57 Q.4 a) With neat diagram explain window to viewport coordinate transformation. 10 5 C5 B2 4 F 21 5 7E EA D1 A 7D 7D 56 35 53 DB b) With neat diagram explain Sutherland Hodgman polygon clipping algorithm. 10 E 15 B2 4 15 AF 5 DC 7E 52 7D 71 56 ED 53 DB 57 F3 EA B2 4 5 DC 7E D1 3A D 71 15 56 Q.5 a) Define projection, with neat diagram describe planar geometric projection. 10 27 DB 57 5E EA C5 4 6B 7E 1 7D 71 7D 5 D b) Describe properties of BEZIER curve. 10 21 DB 5 E EA B2 4 15 D5 35 7E 71 5 56 ED AF 27 21 DB EA E4 D5 B 35 3 71 5 B7 6 C5 Q.6 a) Describe various principles of traditional animation. 10 AF 27 21 5 EA E4 1D 6B 35 3 b) Write short note on Depth buffer algorithm. 10 5 7 C5 7 AF 21 DB 45 EA D 35 7E 3 71 57 5 C5 AF 21 DB EA D1 7D 35 3 ************* 71 5E 5 C5 15 AF 21 EA 7D ED 35 3 15 C5 15 AF 5 52 7D 7D ED 3 F3 C5 B2 15 5 11857 3A 7D 7D 56 ED C5 B2 E4 15 5 7D 7D 56 ED B2 E4 B7E456B27D5ED157DC53AF35215EA71D 15 D5