b)

16 a)

b)

17 a)

b)
18 a)
b)

19 a)
b)

10000CS401122002

Explain the boundary representation and space partitioning representation

schemes used for solid object representation.

Describe the steps involved in scaling a 3D object with respect to a fixed point

(xf, yf, zf). Write the composite transformation matrix.

Given a clipping window A(10,-20), B(80,-20), C(80,20) and D(10,20).

Using Cohen Sutherland line clipping algorithm, clip the line segment joining

the points P(-20,10) and Q(70,-20). Find the end points of the visible portion.
PART 0

Answer any two full questions, each carries 12 marks.
Explain in detail the scan line algorithm for visible surface detection by pointing

out the data structures used in this algorithm.

Distinguish between Cavalier and Cabinet projections.

With a neat block diagram explain the fundamental steps in image processing.
Consider the image segment and compute the length of the shortest 4- , 8- and
m-path between p and q by considering two set of values for V:

(1) V={0,1} Gi)V={1,2}. If a particular path does not exist explain the reason for

the above two cases of ५ ,

Derive a transformation matrix for oblique parallel projection.
What do you understand by histogram equalization of an image? Illustrate with

suitable example show how equalization is done by dividing the list.

Page 3 of 3

(3)

(4)

(5)

(8)

(4)
(7)
(5)

(6)

(6)