论文信息 - A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.

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

[2] George Merrill Chaikin,et al. An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[3] Nira Dyn,et al. Using parameters to increase smoothness of curves and surfaces generated by subdivision , 1990, Comput. Aided Geom. Des..

[4] G. Mustafa,et al. Subdivision depth for triangular surfaces , 2016 .

[5] Nira Dyn,et al. Analysis of uniform binary subdivision schemes for curve design , 1991 .

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

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

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

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

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