Efficient evaluation of splines
From MaRDI portal
Publication:797952
DOI10.1007/BF02240188zbMATH Open0546.65003MaRDI QIDQ797952FDOQ797952
Authors: Wolfgang Boehm
Publication date: 1984
Published in: Computing (Search for Journal in Brave)
Recommendations
Numerical computation using splines (65D07) Spline approximation (41A15) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)
Cites Work
Cited In (13)
- Truncated Laurent expansions for the fast evaluation of thin plate splines
- Title not available (Why is that?)
- Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices
- Efficient evaluation of triangular B-spline surfaces
- Computing the derivative of NURBS with respect to a knot
- A survey of curve and surface methods in CAGD
- Taylor's magic splines
- Computing a chain of blossoms, with application to products of splines
- Computing a chain of blossoms, with application to products of splines
- A short proof of an algorithm by Boehm
- Comments on some B-spline algorithms
- Efficient algorithms for the implementations of \(B\)-splines
- Title not available (Why is that?)
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)