cg and ip jan 2024
cg and ip jan 2024
1 Suppose you have a raster system designed using an 10 inches × 12 inches (3)
screen with a resolution of 100 pixels per inch in each direction. Find the frame
buffer size required if 6 bits are used to store one pixel in the buffer?
2 Compare DDA and Bresenham’s line drawing algorithm. (3)
3 Describe the 2-Dimension basic transformations (3)
4 Write down 4-neighbour boundary filling algorithm (3)
5 Discuss on homogeneous coordinate system and specify one significance (3)
6 Illustrate a window and a viewport in a 2D coordinate system (3)
7 Describe the steps involved in converting an analog image to a digital image (3)
8 List out any 3 Applications of image processing in medical field (3)
9 Discuss on Power-law transformation and its significance in image processing (3)
10 Differentiate low pass filtering and high pass filtering concept (3)
PART B
Answer one full question from each module, each carries 14 marks.
Module I
11 a) Describe the working principle of a Refresh CRT monitor with suitable diagrams (6)
b) Calculate the points between the starting point (9,18) and ending point (14, 22) (8)
Bresenham’s line drawing algorithm.
OR
12 a) Differentiate raster scan display with random scan display. List out the (7)
applications of shadow masking techniques used in CRT.
b) Generate all the first and second octant points of a circle using midpoint circle (7)
drawing algorithm, given with the centre point coordinates as (0, 0) and radius as
10.
Page 1of 3
0300CST304052204
Module II
13 a) Describe scan-line polygon filling algorithm and illustrate how it manages the (9)
special cases.
b) Define shear. Demonstrate x direction shear with an example (5)
OR
14 a) Perform the following transformations on a point (6, 4). (10)
i) Translate by tx = −2 and ty = 4
ii) Then, Scale by sx = 2 and sy = 1
iii) And Rotate by 90O in clockwise direction. Determine the final
coordinates of the transformed point.
b) Describe on composite transformations and show that two successive (4)
translations are additive.
Module III
15 a) Write the Sutherland Hodgeman polygon clipping algorithm and explain with an (8)
example
b) Show how intersection points are calculated with clipping window boundary in (6)
Cohen Sutherland line clipping algorithm.
OR
16 a) Discuss on the types of perspective projections. (6)
b) Describe the scan line algorithm used for visible surface detection (8)
Module IV
17 a) Discuss the steps involved in image processing. Illustrate with an example (8)
b) Discuss on various image classes based on the storage space allocated for pixel (6)
intensities.
OR
18 a) Consider an image segment shown below. (8)
3 1 2 1 (q)
2 3 0 2
1 2 1 1
(p) 1 0 1 2
(i) Let V={1,2} and compute the length of the shortest 4-,8- and m- path
between p and q. If a particular path does not exist between these two points,
explain why?
Page 2of 3
0300CST304052204
Page 3of 3