Institute of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel
Abstract:
Piecewise Bézier Curves are constructed using a minimization principle. Ck and GCk continuity is imposed by linear constraints. The corresponding quadratic programming with linear constraints problem is introduced and solved by duality methods. Bordering matrices methods are implemented to deal with local refinement (subdivision). The result is a versatile tool for defining/editing contours made of piecewise Bézier curves.