Abstract
We investigate the Lane–Riesenfeld subdivision algorithm for uniform B-splines, when the arithmetic mean in the various steps of the algorithm is replaced by nonlinear, symmetric, binary averaging rules. The averaging rules may be different in different steps of the algorithm. We review the notion of a symmetric binary averaging rule, and we derive some of its relevant properties. We then provide sufficient conditions on the nonlinear binary averaging rules used in the Lane–Riesenfeld algorithm that ensure the convergence of the algorithm to a continuous function. We also show that, when the averaging rules are C 2 with uniformly bounded second derivatives, then the limit is a C 1 function. A canonical family of nonlinear, symmetric averaging rules, the p-averages, is presented, and the Lane–Riesenfeld algorithm with these averages is investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Cohen, N. Dyn, B. Matei, Quasilinear subdivision schemes with applications to ENO interpolation, Appl. Comput. Harmon. Anal. 15, 89–116 (2003).
N. Dyn, Subdivision schemes in computer aided geometric design, in Wavelets, Subdivision Algorithms and Radial Basis Functions, ed. by W. Light. Advances in Numerical Analysis, vol. 2 (Clarendon Press, Oxford, 1992), pp. 36–104.
N. Dyn, Three families of nonlinear subdivision schemes, in Multivariate Approximation and Interpolation, ed. by K. Jetter, D. Buhmann, W. Haussmann, R. Schaback, J. Stöckler (Elsevier, Amsterdam, 2005), pp. 23–38.
N. Dyn, P. Oswald, Univariate subdivision schemes and multi-scale transforms: the nonlinear case, in Multiscale, Nonlinear and Adaptive Approximation, ed. by R.A. DeVore, A. Kunoth (Springer, Berlin, 2009), pp. 203–247.
R. Goldman, E. Vouga, S. Schaefer, On the smoothness of real-valued functions generated by subdivision schemes using nonlinear binary averaging, Comput. Aided Geom. Des. 26, 231–242 (2009).
G.H. Hardy, J.E. Littlewood, G. Polya, Inequalities (Cambridge University Press, Cambridge, 1934).
J. Lane, R. Riesenfeld, A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Trans. Pattern Anal. Mach. Intell. 2, 35–46 (1980).
L. Noakes, Nonlinear corner cutting, Adv. Comput. Math. 8, 165–177 (1998).
L. Noakes, Accelerations of Riemannian quadratics, Proc. Am. Math. Soc. 127, 1827–1836 (1999).
S. Schaefer, R. Goldman, Non-uniform subdivision for B-splines of arbitrary degree, Comput. Aided Geom. Des. 26, 75–81 (2009).
S. Schaefer, E. Vouga, R. Goldman, Nonlinear subdivision through nonlinear averaging, Comput. Aided Geom. Des. 25, 162–180 (2008).
J. Wallner, N. Dyn, Convergence and C 1 analysis of subdivision schemes on manifolds by proximity, Comput. Aided Geom. Des. 22, 593–622 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Albert Cohen.
Rights and permissions
About this article
Cite this article
Dyn, N., Goldman, R. Convergence and Smoothness of Nonlinear Lane–Riesenfeld Algorithms in the Functional Setting. Found Comput Math 11, 79–94 (2011). https://doi.org/10.1007/s10208-010-9080-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10208-010-9080-2
Keywords
- Nonlinear subdivision schemes
- Lane–Riesenfeld algorithm
- Data refinement
- Nonlinear symmetric averages
- p-averages
- Convergence and smoothness analysis