High order smoothness of non-linear Lane-Riesenfeld algorithms in the functional setting
From MaRDI portal
Publication:2010280
Recommendations
- Convergence and smoothness of nonlinear Lane-Riesenfeld algorithms in the functional setting
- Smoothing nonlinear subdivision schemes by averaging
- On the smoothness of real-valued functions generated by subdivision schemes using nonlinear binary averaging
- Nonlinear subdivision through nonlinear averaging
- Generalized Lane-Riesenfeld algorithms
Cites work
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- A necessary and sufficient proximity condition for smoothness equivalence of nonlinear subdivision schemes
- A new method for the analysis of univariate nonuniform subdivision schemes
- A practical guide to splines.
- Analysis of asymptotically equivalent binary subdivision schemes
- Convergence and smoothness of nonlinear Lane-Riesenfeld algorithms in the functional setting
- Nonlinear subdivision through nonlinear averaging
- Smoothing nonlinear subdivision schemes by averaging
- Using Laurent polynomial representation for the analysis of non-uniform binary subdivision schemes
Cited in
(5)- On the smoothness of real-valued functions generated by subdivision schemes using nonlinear binary averaging
- Convergence and smoothness of nonlinear Lane-Riesenfeld algorithms in the functional setting
- Generalized Lane-Riesenfeld algorithms
- Smoothing nonlinear subdivision schemes by averaging
- A new method for the analysis of univariate nonuniform subdivision schemes
This page was built for publication: High order smoothness of non-linear Lane-Riesenfeld algorithms in the functional setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010280)