Computing B-spline control points using polar forms
The author attacks the problem of computing the control points of a \(B\)- spline curve from the knots of the corresponding \(B\)-spline functions. His main result (Theorem 3) says that it is possible to compute \(B\)- spline control points explicitly as values of symmetric multiaffine maps of a sequence of consecutive knots. In the second part of the paper, the new result is used to address the problems of knot insertion, degree elevation and osculatory \(B\)-spline interpolation. Several examples illustrate quite nicely the strength of the methods.
- B-spline finite-element method in polar coordinates
- On Hermite interpolation with B-splines
- Using general polar values as control points for polynomial curves
- An explicit formula for the control points of periodic uniform spline interpolants and its application
- Quasi-interpolant operators in Bernstein basis
- Computation of Hermite interpolation in terms of B-spline basis using polar forms
- scientific article; zbMATH DE number 4133546 (Why is no real title available?)
- A Geometric Proof of Total Positivity for Spline Interpolation
- Control point insertion for B-spline curves
- scientific article; zbMATH DE number 1487775 (Why is no real title available?)
- Computing a chain of blossoms, with application to products of splines
- Computing a chain of blossoms, with application to products of splines
This page was built for publication: Computing B-spline control points using polar forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182357)