High order smoothness of non-linear Lane-Riesenfeld algorithms in the functional setting

DOI10.1016/J.CAGD.2019.03.003zbMATH Open1505.65053OpenAlexW2938485305WikidataQ128060068 ScholiaQ128060068MaRDI QIDQ2010280FDOQ2010280

Yanyan Li

Publication date: 27 November 2019

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2019.03.003

zbMATH Keywords

Laurent polynomialsanalysis of non-uniform subdivisionnon uniform Lane-Riesenfeld algorithmsmoothly varying averages

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• A practical guide to splines.
• Analysis of asymptotically equivalent binary subdivision schemes
• Nonlinear subdivision through nonlinear averaging
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Using Laurent polynomial representation for the analysis of non-uniform binary subdivision schemes
• A new method for the analysis of univariate nonuniform subdivision schemes
• A necessary and sufficient proximity condition for smoothness equivalence of nonlinear subdivision schemes
• Convergence and smoothness of nonlinear Lane-Riesenfeld algorithms in the functional setting
• Smoothing nonlinear subdivision schemes by averaging

Cited In (1)

• 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)