problem 1:
Give the definition of the cubic Bezier curve.
problem 2:
Derive the conditions essential to make sure that two cubic Bezier curves join with C1-continuity.
problem 3:
describe, in detail, an algorithm for drawing a cubic Bezier curve to a given tolerance by using straight lines. You might suppose that you already have an algorithm for drawing a straight line.
problem 4:
Describe why and how homogeneous co-ordinates are employed in computer graphics.
a) describe, in outline, each of the z-buffer, BSP tree and painter's algorithm techniques for rendering a set of 3D polygons.
b) Compare and contrast the three methods.