Solve any one question from Q.1(a,b) & Q2(a,b)
1(a)
What are the steps required to plot the line whose slope is between 0 to 45° using Bresenham's method?
6 M
1(b)
Write a pseudo-C algorithm for polygon filling by seed fill polygon.
6 M
2(a)
List various polygon filling algorithms. Explain scan line algorithm with mathematical formulation.
6 M
2(b)
Explain DDA algorithm for the line with example. Discuss its advantages and disadvantages.
6 M
Solve any one question from Q.3(a,b)& Q.4(a,b)
3(a)
Explain Cohen-Sutherland Algorithm with the help of suitable example.
6 M
3(b)
Obtain the 3-D transformation matrices for :
i) Translation
ii) Scaling
iii) Rotation about an arbitrary axis.
i) Translation
ii) Scaling
iii) Rotation about an arbitrary axis.
6 M
4(a)
Describe Sutherland-Hodgman polygon clipping algorithm. What is its limitation?
6 M
4(b)
What is the concept of vanishing point in perspective projection? Explain with diagram.
6 M
Solve any one question from Q.5(a,b) & Q.6(a,b)
5(a)
Compare Ground and Phong's method of shading
7 M
5(b)
Explain HSV and CMY colour model.
6 M
6(a)
Explain CIE chromaticity diagram; aalso explain how RGB to CMY conversion is done.
7 M
6(b)
Compare RGB and HVS color model.
6 M
Solve any one question from Q.7(a,b) & Q.8(a,b)
7(a)
What are the properties of Bezier Curve? Describe the procedure to generate Bezier Curve.
7 M
7(b)
What do you mean by topological and fractal dimensions?
6 M
8(a)
Explain how fractals are used to generate fractal surfaces.
7 M
8(b)
Compare Bezier and B-spline techniques for curve generation and discuss properties.
6 M
More question papers from Computer Graphics