Analysis of subdivision schemes for nets of functions by proximity and controllability

DOI10.1016/j.cam.2011.06.004zbMath1235.65020OpenAlexW2060729466MaRDI QIDQ651101

Constanza Conti, N. Richter-Dyn

Publication date: 8 December 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.004

zbMATH Keywords

controllabilityconvergencesmoothnessproximityblending spline-typenet subdivision schemespoint subdivision schemes

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

A weighted binary average of point-normal pairs with application to subdivision schemes ⋮ Univariate subdivision schemes for noisy data with geometric applications ⋮ \(C^{1}\) analysis of some 2D subdivision schemes refining point-normal pairs with the circle average ⋮ Convergence analysis of corner cutting algorithms refining nets of functions ⋮ Interpolatory blending net subdivision schemes of Dubuc-Deslauriers type ⋮ Manifold-valued subdivision schemes based on geodesic inductive averaging

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blending based corner cutting subdivision scheme for nets of curves
• Interpolatory blending net subdivision schemes of Dubuc-Deslauriers type
• Polynomial reproduction by symmetric subdivision schemes
• Convergence and \(C^1\) analysis of subdivision schemes on manifolds by proximity
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces

This page was built for publication: Analysis of subdivision schemes for nets of functions by proximity and controllability