Q1. describe Floating horizon algorithm for the hidden surface removal. Illustrate the merits and demerits of the Floating horizon algorithm.

Q2. Fill up the closed polygon with vertices (5, 6), (5, 12), (14, 12), (14, 6). Use scan line seed fill algorithm with (9, 9) as seed. Fill just two scan lines.

Q3. For a cubic Bezier curve with given 4 control points, illustrate that the curve should pass via the first and last control points.

Q4. Determine the coordinates of the mid-point of a Bezier curve given the points P1(10, 10), P2(20, 40), P3(60, 60), P4(80, 20).

Q5. Sketch the convex hull of the above curve.

Q6. describe in brief the constructive solid-geometry process for generating solids by using various methods.

Q7. Let consider a unit cube with vertices (0, 0, 0), (0, 0, 1), (1, 0, 0), (0, 1, 0), (1, 1, 0), (0,1, 1), (1, 0, 1) and (1, 1, 1). Perform the perspective projection with centre of projection at P(0.5, 0, 5) and projection done to plane z = 0. Work out the projected coordinates of points (1,0,1) and (1,1,1).