A new extension algorithm for cubic B-splines based on minimal strain energy (Q2644503): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q735607 |
||
Property / reviewed by | |||
Property / reviewed by: Ljubiša Kocić / rank | |||
Revision as of 14:20, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new extension algorithm for cubic B-splines based on minimal strain energy |
scientific article |
Statements
A new extension algorithm for cubic B-splines based on minimal strain energy (English)
0 references
3 September 2007
0 references
From the authors' summary: This paper presents an algorithm for extending cubic B-spline curves or surfaces to one or more target points. To keep the extension curve segment \(GC^2\)-continuous with the original one, a family of cubic polynomial interpolation curves can be constructed. One curve is chosen as the solution from a sub-class of such a family by setting one \(GC^2\) parameter to be zero and determining the second \(GC^2\) parameter by minimizing the strain energy. To simplify the final curve representation, the extension segment is reparameterized to achieve \(C^2\)-continuity with the given B-spline curve, and then knot removal from the curve is done. As a result, a sub-optimized solution subject to the given constraints and criteria is obtained. Additionally, new control points of the extension B-spline segment can be determined by solving lower triangular linear equations. Some computing examples for comparing our method and other methods are given.
0 references
\(GC^2\)-continuous
0 references
extension
0 references
minimal strain energy
0 references
knot removal
0 references
parameterization
0 references
numerical examples
0 references
algorithm
0 references
cubic B-spline curves
0 references
cubic \(B\)-spline surfaces
0 references
cubic polynomial interpolation curves
0 references