Efficient evaluation of splines
From MaRDI portal
An algorithm is presented to compute the Taylor expansion of a polynomial B-spline function from its de Boor points. It is shown to be more efficient than existing methods and has the additional advantage of being reversible.
Recommendations
Cites work
Cited in
(16)- Comments on some B-spline algorithms
- A survey of curve and surface methods in CAGD
- A short proof of an algorithm by Boehm
- Computing the derivative of NURBS with respect to a knot
- Truncated Laurent expansions for the fast evaluation of thin plate splines
- Efficient evaluation of triangular B-spline surfaces
- Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices
- scientific article; zbMATH DE number 4214634 (Why is no real title available?)
- Efficient algorithms for the implementations of B-splines
- scientific article; zbMATH DE number 1972813 (Why is no real title available?)
- Taylor's magic splines
- scientific article; zbMATH DE number 1405423 (Why is no real title available?)
- On the numerical computation of the derivatives of a B-spline series
- Computing a chain of blossoms, with application to products of splines
- Computing a chain of blossoms, with application to products of splines
- Computing values and derivatives of Bézier and B-spline tensor products
This page was built for publication: Efficient evaluation of splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797952)