A new extension algorithm for cubic B-splines based on minimal strain energy

From MaRDI portal
Publication:2644503





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.











This page was built for publication: A new extension algorithm for cubic B-splines based on minimal strain energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644503)