## Computer Graphics - May 2016

### Computer Engineering (Semester 4)

TOTAL MARKS: 80

TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.

(2) Attempt any **three** from the remaining questions.

(3) Assume data if required.

(4) Figures to the right indicate full marks.
**1(a)** Prove that two successive rotations are additive.(5 marks)
**1(b)** Explain the various applications of computer graphics.(5 marks)
**1(c)** Explain dithering technique in detail.(5 marks)
**1(d)** Specify the disadvantage of DDA algorithm.(5 marks)
**2(a)** Explain the steps used in rotation of 2D object about an arbitrary axis and hence derive the matrix for the same.(10 marks)
**2(b)** Compare flood fill and boundary fill algorithm illustrating the same with a diagram.(10 marks)
**3(a)** Explain any one polygon cliping algorithm in detail.(10 marks)
**3(b)** Explain midpoint circle algorithm. Explain the same to plot a circle whose radius is 10 units.(10 marks)
**4(a)** Explain Cohen Sutherland line clipping algorithm in detail(10 marks)
**4(b)** Explain what is meant by Bezier curve. Alsi explain the properties of bezier curve.(10 marks)
**5(a)** What is meant by parallel and perspective projections? Derive matrix for perspective projections.(10 marks)
**5(b)** Define window, viewport and hence explain how window to viewport transformation is performed.(10 marks)

### Write short notes on (any Two)

**6(a)** Gouraud and phong shading technique(10 marks)
**6(b)** Shearing and viewing transformation.(10 marks)
**6(c)** Sweep representation.(10 marks)