A Class of Refinement Schemes With Two Shape Control Parameters

A subdivision scheme defines a smooth curve or surface as the limit of a sequence of successive refinements of given polygon or mesh. These schemes take polygons or meshes as inputs and produce smooth curves or surfaces as outputs. In this paper, a class of combine refinement schemes with two shape control parameters is presented. These even and odd rules of these schemes have complexity three and four respectively. The even rule is designed to modify the vertices of the given polygon, whereas the odd rule is designed to insert a new point between every edge of the given polygon. These schemes can produce high order of continuous shapes than existing combine binary and ternary family of schemes. It has been observed that the schemes have interpolating and approximating behaviors depending on the values of parameters. These schemes have an interproximate behavior in the case of non-uniform setting of the parameters. These schemes can be considered as the generalized version of some of the interpolating and B-spline schemes. The theoretical as well as the numerical and graphical analysis of the shapes produced by these schemes are also presented.

[1]  Xiaonan Luo,et al.  A combined approximating and interpolating subdivision scheme with C2 continuity , 2012, Appl. Math. Lett..

[2]  G. Mustafa,et al.  Family of -Ary Univariate Subdivision Schemes Generated by Laurent Polynomial , 2018 .

[3]  Yilun Shang,et al.  Finite-Time Weighted Average Consensus and Generalized Consensus Over a Subset , 2016, IEEE Access.

[4]  G. Mustafa,et al.  Unification and Application of 3-point Approximating Subdivision Schemes of Varying Arity , 2012 .

[5]  N. Dyn Subdivision schemes in CAGD , 1992 .

[6]  Jieqing Tan,et al.  A new four-point shape-preserving C3 subdivision scheme , 2014, Comput. Aided Geom. Des..

[7]  Shahid S. Siddiqi,et al.  A new three-point approximating C2 subdivision scheme , 2007, Appl. Math. Lett..

[8]  Jieqing Tan,et al.  Convexity preservation of five-point binary subdivision scheme with a parameter , 2014, Appl. Math. Comput..

[9]  G. Mustafa,et al.  Construction and Analysis of Binary Subdivision Schemes for Curves and Surfaces Originated from Chaikin Points , 2016 .

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

[11]  Jieqing Tan,et al.  Six-Point Subdivision Schemes with Cubic Precision , 2018 .

[12]  Jieqing Tan,et al.  A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme , 2017 .

[13]  Feng Guo,et al.  Designing multi-parameter curve subdivision schemes with high continuity , 2014, Appl. Math. Comput..

[14]  Jieqing Tan,et al.  A Binary Five-point Relaxation Subdivision Scheme ⋆ , 2013 .

[15]  Carolina Vittoria Beccari,et al.  A unified framework for interpolating and approximating univariate subdivision , 2010, Appl. Math. Comput..

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

[17]  Jungho Yoon,et al.  A family of non-uniform subdivision schemes with variable parameters for curve design , 2017, Appl. Math. Comput..

[18]  Nira Dyn Analysis of Convergence and Smoothness by the Formalism of Laurent Polynomials , 2002, Tutorials on Multiresolution in Geometric Modelling.

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

[20]  G. Mustafa,et al.  Generalized and Unified Families of Interpolating Subdivision Schemes , 2014 .

[21]  Kai Hormann,et al.  Polynomial reproduction for univariate subdivision schemes of any arity , 2011, J. Approx. Theory.

[22]  Shahid S. Siddiqi,et al.  A combined binary 6-point subdivision scheme , 2015, Appl. Math. Comput..

[23]  Ghulam Mustafa,et al.  A unified three point approximating subdivision scheme , 2011 .

[24]  Shahid S. Siddiqi,et al.  Improved binary four point subdivision scheme and new corner cutting scheme , 2010, Comput. Math. Appl..