## Computer Graphics - May 2015

### 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) ** What are aliasing and antialiasing? Explain any one antialiasing method. (5 marks)

** 1 (b) ** What are the disadvantages of DDA algorithm? (5 marks)

** 1 (c) ** What is viewing tranformation? (5 marks)

** 1 (d) ** Define Shearing and give example. (5 marks)

** 2 (a) ** Explain the midpoint circle generating algorithm. (8 marks)

** 2 (b) ** Explain the steps used in rotation of 2-D object about an arbitrary axis and derive the matrices of same. (12 marks)

** 3 (a) ** Explain Liang-Barsky line clipping algorithm with suitable example. (10 marks)

** 3 (b) ** Explain Sutherland-Hodgeman polygon Clipping algorithm in detail. (10 marks)

** 4 (a) ** What are Parallel and Perspective projection and derive the matrix for perspective projection. (10 marks)

** 4 (b) ** Explain the properties of Bezier curves. (10 marks)

** 5 (a) ** What is the use of Scan line method and explain all the steps. (10 marks)

** 5 (b) ** Define Koch curve? How do you construct the Koch curve? (10 marks)

### Write short note on any four:

** 6 (a) ** Open CI. (5 marks)

** 6 (b) ** Area subdivision method. (5 marks)

** 6 (c) ** Composite transmformation (5 marks)

** 6 (d) ** Sweep representations. (5 marks)

** 6 (e) ** Flood fill algorithm. (5 marks)