Question Paper: Computer Graphics Question Paper - Dec 17 - Computer Engineering (Semester 4) - Mumbai University (MU)
0

## Computer Graphics - May 17

### Computer Engineering (Semester 4)

Total marks: 80
Total time: 3 Hours

N.B
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume any suitable data wherever necessary and justify the same..

Q1

a) Compare Raster and Random Scan Techniques.
(5 marks) 00

b) What are the disadvantages of DDA algorithm.
(5 marks) 00

c) Derive the matrix for 2D rotation about an arbitrary point.
(5 marks) 00

d) Write a boundary fill procedure to fill 8-connected region.
(5 marks) 00

Q2

a) Explain Bresenham's Circle drawing algorithm in detail.
(10 marks) 00

b) Derive the transformation matrix to magnify the triangle with vertices A(0,0), B(1,2), C(3,2), to twice its size so that the point c(3,2) remain fixed.
(10 marks) 00

Q3

a) Explain Cohen-Sutherland clipping algorithm for line with suitable example.
(10 marks) 00

b) Explain Weiler-Artherton algorithm for polygon clipping. What are the advantages over the other plygon clipping algorithm. Explain its working with an example.
(10 marks) 00

Q4

a) Define Window, viewport and derive window to viewport transformation
(10 marks) 00

b) Differentiate between parallel and prespective projection. Explain with the help of example.
(10 marks) 00

Q5

a) Explain Black surface Detection method in detail with an example.
(10 marks) 00

b) Discuss Halftoning and Dithering techqinues
(10 marks) 00

Q6 Write a short note on any two of the following :

a) B-Spline curves
(10 marks) 00

b) 3-D Rotation
(10 marks) 00

c) Fractals
(10 marks) 00