The document outlines an exam for a computer graphics course, providing 5 questions covering topics like rotation matrices, character generation techniques, vanishing points and perspective foreshortening, applications of computer graphics, midpoint ellipse generation, line reflection, texture mapping, animation of 3D objects, and polygon clipping and hidden surface removal algorithms like Sutherland-Hodgeman and Z-buffer. Students are asked to attempt any 5 of the questions, with Question 1 being mandatory, and each question is worth various point values totaling to a maximum of 40 marks for the exam.
The document outlines an exam for a computer graphics course, providing 5 questions covering topics like rotation matrices, character generation techniques, vanishing points and perspective foreshortening, applications of computer graphics, midpoint ellipse generation, line reflection, texture mapping, animation of 3D objects, and polygon clipping and hidden surface removal algorithms like Sutherland-Hodgeman and Z-buffer. Students are asked to attempt any 5 of the questions, with Question 1 being mandatory, and each question is worth various point values totaling to a maximum of 40 marks for the exam.
The document outlines an exam for a computer graphics course, providing 5 questions covering topics like rotation matrices, character generation techniques, vanishing points and perspective foreshortening, applications of computer graphics, midpoint ellipse generation, line reflection, texture mapping, animation of 3D objects, and polygon clipping and hidden surface removal algorithms like Sutherland-Hodgeman and Z-buffer. Students are asked to attempt any 5 of the questions, with Question 1 being mandatory, and each question is worth various point values totaling to a maximum of 40 marks for the exam.
CO 313 Computer Graphics Max. Marks: 40 Time: 3:00 Hours atory. Note: Attem pt any FIVE questions. Question No. 1 is mand
R (-0) and R" 1(0).
Ql (a) What is the relationship betw een rotation R (0), ple. (b) Expl ain the methods of character generation with exam hortening. (c) Desc ribe vanishing points. Discu ss perspective fores ation and (d) List the applications of comp uter graphics in educ (2X4=8)
·ca1 expression for midp oint ellips e generation
• • .Discu ss all the cases of algor ithm. · · 8
r reflec tion abou t a line L with slope 'm'
lCWIJOrt mapp ing in the form of comp osite
(4X2=8)
and suitable example.
, 1] the verti ces of a eat t = (0.15, (4X2=8) - --1'52-- QS (a) Draw the flowchart for Sutherland Hodgeman polygon clipping
rblltfer algorithm. Also, discuss how Z-buffer algorithm