Error bounds for a class of subdivision schemes based on the two-scale refinement equation

DOI10.1016/J.CAM.2011.06.031zbMath1230.65024OpenAlexW2015791156MaRDI QIDQ645712

María Moncayo, Sergio Amat

Publication date: 10 November 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.031

zbMATH Keywords

error analysiscontrol polygontwo-scale refinement equationbinary subdivision schemes

Mathematics Subject Classification ID

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

Related Items (2)

A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon ⋮ Improving the stability bound for the PPH nonlinear subdivision scheme for data coming from strictly convex functions

Cites Work

• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
• Estimating error bounds for binary subdivision curves/surfaces
• Analysis of uniform binary subdivision schemes for curve design
• Stationary subdivision
• Ten Lectures on Wavelets
• Tight linear envelopes for splines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Error bounds for a class of subdivision schemes based on the two-scale refinement equation