\(G^{k,l}\)-constrained multi-degree reduction of Bézier curves (Q5962638): Difference between revisions
From MaRDI portal
Latest revision as of 10:27, 11 July 2024
scientific article; zbMATH DE number 6541597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(G^{k,l}\)-constrained multi-degree reduction of Bézier curves |
scientific article; zbMATH DE number 6541597 |
Statements
\(G^{k,l}\)-constrained multi-degree reduction of Bézier curves (English)
0 references
15 February 2016
0 references
The authors elaborate a new method of \(G^{k,l}\)-constrained multi-degree reducing Bézier curves with respect to the least squares norm. This method has better complexity than the existing ones. First of all, the specific continuity conditions are related with the control points. A model of the multi-degree reduction with prescribed boundary control points is described. The optimum values of the parameters are obtained by minimizing the least squares error function, discussing two possibilities: an optimization method (either the interactive active-set method or a sequential quadratic programming method) and solving a system of linear equations. The implementation of the described algorithm is accompanied by practical examples and compared with existing techniques.
0 references
constrained dual Bernstein basis
0 references
Bézier curves
0 references
multi-degree reduction
0 references
geometric continuity
0 references
quadratic programming
0 references
nonlinear programming
0 references
numerical examples
0 references
least squares norm
0 references
boundary control point
0 references
algorithm
0 references
0 references
0 references
0 references
