0

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

## 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.

**b)**What are the disadvantages of DDA algorithm.

**c)**Derive the matrix for 2D rotation about an arbitrary point.

**d)**Write a boundary fill procedure to fill 8-connected region.

**Q2**

**a)**Explain Bresenham's Circle drawing algorithm in detail.

**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.

**Q3**

**a)**Explain Cohen-Sutherland clipping algorithm for line with suitable example.

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

**Q4**

**a)**Define Window, viewport and derive window to viewport transformation

**b)**Differentiate between parallel and prespective projection. Explain with the help of example.

**Q5**

**a)**Explain Black surface Detection method in detail with an example.

**b)**Discuss Halftoning and Dithering techqinues

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

**a)**B-Spline curves

**b)**3-D Rotation

**c)**Fractals

0

ADD COMMENT