Matrix representation for multi-degree reduction of Bézier curves (Q2573854)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrix representation for multi-degree reduction of Bézier curves |
scientific article |
Statements
Matrix representation for multi-degree reduction of Bézier curves (English)
0 references
25 November 2005
0 references
The multi-degree reduction (MDR) of Bézier curves with constraints of endpoints \(L_2\)-continuity is considered. The starting point is in the so called MDR by the \(L_2\) method of \textit{G.-D. Chen} and \textit{G.-J.Wang} [ibid. 19, No.~6, 365--377 (2002)], which derives an explicit form of the least squares solution of multi-degree reduction of Bézier curves with high order endpoints continuity. It contains some recursive formulas, requiring the conversion and the inverse transformation matrix between Jacobi and Bernstein polynomials. As consequence, by solving a recursive formula explicitly, the MDR by \(L_2\) method is represented in a matrix form. A product of the degree reduction matrix and the vector of the original control points gives the control points of the degree reduced Bézier curve. The degree reduction matrix is independent of the control points.
0 references
Bézier curves
0 references
Jacobi polynomials
0 references
degree reduction
0 references
endpoints continuity
0 references
matrix representation
0 references
least squares solution
0 references