Answer All Questions, Each Carries 4 Marks.: CS401 Computer Graphics
Answer All Questions, Each Carries 4 Marks.: CS401 Computer Graphics
PART A
Answer all questions, each carries 4 marks. Marks
1 What do you understand by the aspect ratio and resolution of a display (4)
screen in a raster scan display?
2 Write the flood fill algorithm for filling a polygon. (4)
3 Write the methods used to plot a dashed line segment. (4)
4 Given a triangle A(20,10) B(80,20) C(50,70). Find the co-ordinates of (4)
vertices after each of the following transformation.
(a) Reflection about the line x=y.
(b) Rotation of the triangle ABC about vertex A in clockwise direction
for an angle 90 degree.
5 Write the different tables used for representing polygon surfaces. Illustrate (4)
with an example.
6 Describe the techniques that can be used to provide text clipping in a (4)
graphics package.
7 Explain about different types of parallel projections. (4)
8 What do you understand by correlation and convolution operations in case of (4)
image processing?
9 Write the Z-buffer algorithm for hidden surface removal. (4)
10 What do you understand by the following terms with respet to pixels. (4)
Neighbours, Adjacency, Connectivity.
PART B
Answer any two full questions, each carries 9 marks.
11 a) Explain the working of a random scan display system with suitable diagram. (6)
b) Explain the working of a beam penetration CRT. (3)
12 a) Write the midpoint circle drawing algorithm. (4)
b) Use midpoint circle drawing algorithm to plot a circle whose radius =20 (5)
units and center is (50, 30).
13 a) A mouse is picked up and placed in another position. Whether the position of (2)
the mouse pointer change. Justify your answer.
b) Explain the working of a light pen. (3)
c) Write the scan line algorithm for filling a polygon. (4)
Page 1of 2
For More Visit : KtuQbank.com
A R7909 Pages: 2
PART C
Answer any two full questions, each carries 9 marks.
14 a) Given a clipping window A(-20,-20), B(40,-20), C(40,30) and D(-20,30). (6)
Using Cohen Sutherland line clipping algorithm, find the visible portion of
the line segment joining the points P(-30,20) and Q(60,-10).
b) Derive an equation for window to viewport transformation by specifying the (3)
sequence of basic transformations involved.
15 a) What are the steps for general 3D rotation if the rotation axis is not parallel (9)
to any one of the principal axis. The rotation axis is defined by the points
P1(x1,y1,z1) and P2(x2,y2,z2). Write down the composite matrix
representation.
16 a) Explain Sutherland Hodgeman polygon clipping algorithm with (5)
illustrations.
b) Describe the transformation which reflects a 2-D object about a line L which (4)
has a y-intercept(0,b) and an angle of intersection theta degree w.r.t. to the x-
axis.
PART D
Answer any two full questions, each carries 12 marks.
17 a) Explain in detail the scan line algorithm for visible surface detection by (7)
pointing out the data structures used in this algorithm..
b) How the cyclic overlaps of surfaces are eliminated in scan line algorithm? (2)
c) In case of an A-buffer algorithm, what information is stored in a linked list. (3)
18 a) Explain the fundamental steps in Digital Image Processing with a neat (8)
diagram?
b) The gray levels in an image g1(x,y) range from a to b. It is decided to (4)
change it into an image g2(x,y) in which the gray levels range from c to d
using a linear transformation of its gray levels. Derive the equation for
g2(x,y) as a function of g1(x,y) by specifying the steps.
19 a) Explain the Robert's, Prewitt's and Sobel’s edge detectors. (6)
b) Derive the transformation matrix for perspective projection with the (6)
projection reference point at position Zprp along the Zv axis and the view
plane at Zvp. Write the perspective transformation equations (i) if the view
place is taken to be the uv plane (ii) if the projection reference point is taken
to be at the viewing co-ordinate origin.
****
Page 2of 2
For More Visit : KtuQbank.com