Browse papers
A

Section A: Long Answer Questions

Attempt any TWO questions.

3 questions·10 marks each
1long10 marks

Explain the scan-line polygon fill algorithm and the boundary fill algorithm with examples.

polygon-fill
2long10 marks

Explain Bezier curves and their properties. Derive the equation of a cubic Bezier curve with four control points.

curves
3long10 marks

Explain Bresenham's line drawing algorithm. Using it, digitize a line from (20, 10) to (30, 18) showing all the computed pixel coordinates.

line-drawing
B

Section B: Short Answer Questions

Attempt any EIGHT questions.

9 questions·5 marks each
4short5 marks

Differentiate between object-space and image-space methods of hidden surface removal.

hidden-surface
5short5 marks

What is a spline? Differentiate between interpolation and approximation splines.

curvesspline
6short5 marks

Explain the key frame system in computer animation.

animation
7short5 marks

Explain the working principle of a Raster scan display and a Random (vector) scan display.

graphics-systems
8short5 marks

Explain the DDA line drawing algorithm with its advantages and disadvantages.

line-drawingdda
9short5 marks

Derive the transformation matrix for rotation about an arbitrary point in 2D.

transformation2d
10short5 marks

Explain the Sutherland-Hodgman polygon clipping algorithm with an example.

clippingpolygon
11short5 marks

Explain the RGB and CMY color models used in computer graphics.

color
12short5 marks

Write the transformation matrices for 3D translation, scaling and rotation about the x-axis.

3dtransformation