Distance for Bézier curves and degree reduction

Abstract

An algorithmic approach to degree reduction of Bézier curves is presented. The algorithm is based on the matrix representations of the degree elevation and degree reduction processes. The control points of the approximation are obtained by the generalised least squares method. The computations are carried out by minimising the L 2 and discrete l 2 distance between the two curves.