Stable evaluation of box-splines

DOI10.1023/A:1019133501773zbMath0885.65010OpenAlexW1482711749MaRDI QIDQ1370333

Leif Kobbelt

Publication date: 2 April 1998

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019133501773

zbMATH Keywords

computational complexitynumerical stabilityrobust implementationbox-splinesde Boor's recursive algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Spline approximation (41A15) Complexity and performance of numerical algorithms (65Y20)

Related Items (14)

Characterization of bivariate hierarchical quartic box splines on a three-directional grid ⋮ A closed PP form of box splines via Green's function decomposition ⋮ The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline ⋮ A practical Box Spline compendium ⋮ Analytic evaluation of the FCC Voronoi-splines ⋮ Fast and stable evaluation of splines and their derivatives generated by the seven-direction quartic box-spline ⋮ New approach to study splines by blossoming method and application to the construction of a bivariate \(C^1\) quartic quasi-interpolant ⋮ An explicit quasi-interpolation scheme based on \(C^1\) quartic splines on type-1 triangulations ⋮ FastSpline: automatic generation of interpolants for lattice samplings ⋮ Construction of a bivariate \(C^2\) septic quasi-interpolant using the blossoming approach ⋮ Fast and stable evaluation of box-splines via the BB-form ⋮ na11 ⋮ Completeness characterization of type-I box splines ⋮ Inner products of box splines and their derivatives

Uses Software

• Unnamed Item

This page was built for publication: Stable evaluation of box-splines