A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon

Abstract This paper introduces a new formula to evaluate the deviation of a binary interpolatory subdivision curve from its data polygon. We first bound the deviation of the new control points of each subdivision step from its data polygon by accumulating the distances between the new control points and the midpoints of their corresponding edges. Then, by finding the maximum deviation of each subdivision step, a formula for estimating the deviation of the limit curve from its data polygon can be deduced. As the applications of the formula, we evaluate the deviations of the uniform, centripetal and chord parametrization four-point interpolatory subdivision scheme, and find that the bounds derived by our method are sharper than bounds by [3]. Of course, we also deduce the new deviations of the six-point interpolatory subdivision scheme, Dyn et al’s four- and six-point subdivision schemes with tension parameters, and Deslauriers–Dubucs eight- and ten-point subdivision schemes.

[1]  Ghulam Mustafa,et al.  Estimating error bounds for tensor product binary subdivision volumetric model , 2006, Int. J. Comput. Math..

[2]  Ulrich Reif.  Best bounds on the approximation of polynomials and splines by their control structure , 2000, Comput. Aided Geom. Des..

[3]  Xiao-Ming Zeng,et al.  Error bounds for Loop subdivision surfaces , 2014, Int. J. Comput. Math..

[4]  Jiansong Deng,et al.  A bound on the approximation of a Catmull-Clark subdivision surface by its limit mesh , 2008, Comput. Aided Geom. Des..

[5]  Zhangjin Huang,et al.  Bounding the Distance between a Loop Subdivision Surface and Its Limit Mesh , 2008, GMP.

[6]  Xiao-Ming Zeng,et al.  Computational formula of depth for Catmull-Clark subdivision surfaces , 2006 .

[7]  Sergio Amat,et al.  Error bounds for a class of subdivision schemes based on the two-scale refinement equation , 2011, J. Comput. Appl. Math..

[8]  Gilles Deslauriers,et al.  Symmetric iterative interpolation processes , 1989 .

[9]  Byung-Gook Lee,et al.  Stationary binary subdivision schemes using radial basis function interpolation , 2006, Adv. Comput. Math..

[10]  G. Mustafa,et al.  Estimating error bounds for binary subdivision curves/surfaces , 2006 .

[11]  Jun-Hai Yong,et al.  Subdivision Depth Computation for Catmull-Clark Subdivision Surfaces , 2006 .

[12]  Jörg Peters,et al.  Tight linear envelopes for splines , 2001, Numerische Mathematik.

[13]  Chongyang Deng.  An explicit formula for the control points of periodic uniform spline interpolants and its application , 2013, Comput. Aided Geom. Des..

[14]  Ghulam Mustafa,et al.  Subdivision depth computation for n-ary subdivision curves/surfaces , 2010, The Visual Computer.

[15]  Zhangjin Huang,et al.  Improved error estimate for extraordinary Catmull–Clark subdivision surface patches , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.

[16]  Jörg Peters,et al.  The distance of a subdivision surface to its control polyhedron , 2009, J. Approx. Theory.

[17]  Nira Dyn,et al.  A 4-point interpolatory subdivision scheme for curve design , 1987, Comput. Aided Geom. Des..

[18]  Kaihuai Qin,et al.  Estimating subdivision depth of Catmull-Clark surfaces , 2004, Journal of Computer Science and Technology.

[19]  Nira Dyn,et al.  Four-point curve subdivision based on iterated chordal and centripetal parameterizations , 2009, Comput. Aided Geom. Des..

[20]  Michael S. Floater.  On the deviation of a parametric cubic spline interpolant from its data polygon , 2008, Comput. Aided Geom. Des..

[21]  G. Mustafa,et al.  Estimating error bounds for quaternary subdivision schemes , 2009 .