Semester : SEMESTER 7
Subject : Computer Graphics
Year : 2020
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 401
Page:2
14
15
16
17
18
19
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
a)
b)
00000CS401121902
PART C
Answer any two full questions, each carries 9 marks.
Use Cohen Sutherland algorithm to clip the line segment joining the points
P(40,80) and Q(120,30) against a clipping window with comers at A(20,20),
B(60,20), C(60,40) and D(20,40).
Draw and explain the two dimensional viewing pipeline.
A point (4,3) is rotated counter clockwise by an angle of 45°. Find the rotation
matrix and resultant point.
Explain how polygon meshes are used for 3D modelling.
Explain Weiler-Atherton polygon clipping with an example.
Describe the methods to model quadric surfaces in 3D.
PART 0
Answer any two full questions, each carries 12 marks.
Derive the linear equation for a 3D object and test whether the coordinates are
inside or outside the plane.
Derive the transformation matrix for perspective projection with suitable
diagram.
Describe histogram equalisation and discuss the role of histogram equalisation
in a digital image.
With a suitable example explain the depth buffer algorithm for hidden surface
elimination.
Explain how edge detection is done using Robert, Prewitt, Sobel operators.
Explain any 3 visible surface detection methods.
%%%%
Page 2௦12
(6)
(3)
(4)
(5)
(5)
(4)
(4)
(8)
(4)
(8)
(6)
(6)