Mathematical Problems in Engineering
Volume 2018 (2018), Article ID 2324893, 9 pages
https://doi.org/10.1155/2018/2324893

Research Article

Six-Point Subdivision Schemes with Cubic Precision

Jun Shi,1,2 Jieqing Tan,1,2 Zhi Liu,¹ and Li Zhang¹

¹School of Mathematics, Hefei University of Technology, Hefei 230009, China
²School of Computer and Information, Hefei University of Technology, Hefei 230009, China

Correspondence should be addressed to Zhi Liu; liuzhi314@126.com

Received 10 July 2017; Revised 5 November 2017; Accepted 22 November 2017; Published 3 January 2018

Academic Editor: Dan Simon

Copyright © 2018 Jun Shi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper presents 6-point subdivision schemes with cubic precision. We first derive a relation between the 4-point interpolatory subdivision and the quintic B-spline refinement. By using the relation, we further propose the counterparts of cubic and quintic B-spline refinements based on 6-point interpolatory subdivision schemes. It is proved that the new family of 6-point combined subdivision schemes has higher smoothness and better polynomial reproduction property than the B-spline counterparts. It is also showed that, both having cubic precision, the well-known Hormann-Sabin’s family increase the degree of polynomial generation and smoothness in exchange of the increase of the support width, while the new family can keep the support width unchanged and maintain higher degree of polynomial generation and smoothness.

1. Introduction

Subdivision is an efficient method for generating curves and surfaces in computer aided geometric design. In general, subdivision schemes can be divided into two categories: interpolatory schemes and approximating schemes. Interpolatory schemes get better shape control while approximating schemes have better smoothness. The most well-known interpolatory subdivision scheme is the classical 4-point binary scheme proposed by Dyn et al. [1]. In 1989, it was extended to the 6-point binary interpolatory scheme by Weissman [2]. Most approximating schemes were developed from splines. Two of the most famous approximating schemes are Chaikin’s algorithm [3] and cubic B-spline refinement algorithm [4], which actually generate uniform quadratic and cubic B-spline curves with continuity and continuity, respectively.

The deep connection between interpolatory schemes and approximating schemes has been studied in many literatures [5–15]. In 2001, Maillot and Stam [5] introduced a push-back operation which is applied at each round of approximating refinement to progressively interpolate the control vertices. In 2007, Li and Ma [6] observed a relation between 4-point interpolatory subdivision and cubic B-spline curve refinement, and, motivated by this relation, they proposed a universal method for constructing interpolatory subdivision through the addition of weighted averaging operations to the mask of approximating subdivision. In 2008, Lin et al. [7] found another relation between 4-point interpolatory subdivision and cubic B-spline refinement and constructed interpolatory subdivision from approximating subdivision based on the relation. The deep connection between interpolatory and approximating schemes was also studied in [8–12] which exploited the generating functions of approximating subdivision and interpolatory subdivision. In 2012, Pan et al. [13] provided a combined ternary approximating and interpolatory subdivision scheme with continuity. Li and Zheng [14] constructed interpolatory subdivision from primal approximating subdivision with a new observation of the link between interpolatory and approximating subdivision. In 2013, Luo and Qi [15] made some theoretical analysis from the generation polynomial perspective and constructed some new interpolatory schemes from approximating schemes.

Our work is motivated by a new observation about the 4-point interpolatory subdivision and the quintic B-spline curve refinement. The observation gives us heuristics to construct combined subdivision schemes from existing subdivision schemes. The idea is to construct the counterparts of cubic and quintic B-spline refinements and make the relations between the 6-point interpolatory subdivision and the counterparts of cubic and quintic B-spline refinements similar to those between the 4-point interpolatory subdivision and the cubic, quintic B-spline curve refinements. Since the 6-point interpolatory subdivision from which the new subdivision scheme is deduced has good properties such as high smoothness and high accuracy, we are interested in studying which properties of the new subdivision scheme are better than their counterparts.

The new family of 6-point combined subdivision schemes is defined as follows:

(1) is called the 6-point combined interpolatory and approximating binary subdivision scheme. If , (1) generates 6-point interpolatory subdivision; otherwise, (1) produces approximating subdivision. It is proved that when suitably setting the tension parameter, all schemes from (1) are able to generate curves with continuity and reproduce cubic polynomials, whereas the B-spline refinements attain only linear precision. Moreover, we also make a comparison of properties between our family and famous Hormann-Sabin’s family [16] which has the same cubic precision.

2. Preliminaries

In this section, we recall some fundamental definitions and results that are necessary to the development of the subsequent results.

Given a set of initial control points , the set of control points at level are recursively defined by the following binary subdivision rules:

The finite set is called mask. The iterative algorithm based on the repeated application of (2) is termed subdivision scheme and is denoted by . The symbol of the scheme is defined as .

Theorem 1 (see [17]). Let a binary subdivision scheme be convergent. Then the mask satisfies

Theorem 2 (see [17]). Let subdivision scheme with mask satisfy (3). Then there exists a subdivision scheme (first-order divided difference scheme of ) with the property

where and . The symbol of is . Generally, if (the th-order divided difference scheme of ) exists with mask , then the symbol of is .

Theorem 3 (see [17]). (a) Let subdivision scheme have mask , and its th-order divided difference scheme exists with mask satisfying

If there exists an integer , such that , then the subdivision scheme is continuous, where

In particular, when ,

(b) Let with being contractive (i.e., maps any initial data to zero). Then, is convergent and continuous.

Theorem 4 (see [18, 19]). Let denote the space of all univariate polynomials with real coefficients up to degree . Then a univariate subdivision scheme

(i)generates if and only if

(ii)reproduces with respect to the parametrization with and denoting the subdivision level, if and only if it generates and

3. Construction of the New Family

This section first explains a new observation about the relation between 4-point interpolatory subdivision and quintic B-spline refinement. Then, a new family of 6-point combined subdivision schemes is deduced.

3.1. A New Observation

Given an initial control polygon with vertices , as shown in Figure 1, the rules of 4-point interpolatory subdivision for generating level vertices are

and quintic B-spline refinement for generating level vertices is

(a) The relation between 4-point scheme and quintic -spline scheme

(b) The relation between 4-point scheme and cubic -spline scheme

Figure 1: The relation between 4-point interpolatory subdivision and B-spline refinement.

Denote by , the displacements of vertices from quintic B-spline refinement to 4-point interpolatory subdivision after one step of refinement, as shown in Figure 1(a), where the black lines represent the initial control polygon, the magenta lines represent the control polygon after one step of 4-point interpolatory subdivision, and the green lines represent the control polygon after one step of quintic B-spline refinement. Then, from (10) and (11), we can get

A new observation is

which shows that the relation between 4-point interpolatory subdivision and quintic B-spline refinement is similar to the one between 4-point interpolatory subdivision and cubic B-spline refinement discovered by Lin et al. in [7]; that is, , as shown in Figure 1(b), where the blue lines represent the control polygon after one step of cubic B-spline refinement. So, from the point of view of displacements, 4-point interpolatory scheme has the same connections with cubic B-spline and quintic B-spline.

We further found that though 6-point interpolatory subdivision is also constructed from polynomial interpolation just like 4-point interpolatory subdivision, analogous connection does not exist between 6-point interpolatory subdivision and quintic B-spline refinement.

3.2. Construction of the New 6-Point Combined Scheme

As is shown in [2], the rules of 6-point interpolatory subdivision for generating level vertices are

Suppose the new subdivision have the following rule:

where are tension parameters, and then

Using relation (13), it can be deduced that

So, we obtain

and then the new subdivision can be concluded from (15) and (18) as

which is the form of (1) in Section 1.

The mask and symbol of subdivision (1) are

respectively. When , symbol (21) can be written as

In particular, when ,

Denote the family of subdivision (1) by and subfamily (22) by . We call them the counterparts of cubic and quintic B-spline refinements based on the 6-point interpolatory subdivision. Figure 2 illustrates the limit curves of some members of . In Section 4, we will prove that the family generates curves with continuity, and the subfamily attains continuity when and reproduces cubic polynomials.

(a)

(b)

(c)

(d)

Figure 2: Some limit curves generated by all with from outside (red) to inside (yellow), respectively. The black is the initial control polygon.

4. Analysis of the New Family

4.1. Smoothness Analysis

Proposition 5. The scheme defined by (1) converges and has smoothness when and , or and ; and when , the subfamily generates continuous limit curves.

Proof. The symbol of can be written as

where

Let denote the coefficients of Laurent polynomial . By Theorem 3(b), if is contractive, then is . When

which shows that is contractive; hence, when

When , the symbol of the subfamily is

which can also be written as , where

When , .
Hence, by Theorem 3(b), is contractive and is when .

4.2. Generation Degree and Reproduction Degree

Polynomial generation and polynomial reproduction are desirable properties because any convergent subdivision scheme that reproduces polynomials of degree has approximation order [18]. The polynomial generation of degree is the capability of subdivision schemes to generate the full space of polynomials of degree [20]. The polynomial reproduction is the capability of subdivision schemes to produce in the limit exactly the same polynomial from which the initial data is sampled. The generation degree is not less than the reproduction degree. For example, the generation degree of degree-n B-spline refinement is , but the reproduction degree of degree-n B-spline refinement only attains 1. Hormann and Sabin [16] proposed a family of subdivision schemes which is defined by the product of the symbol of B-spline refinement with a degree-2 polynomial and increased the degree of polynomial reproduction of B-spline schemes from 1 to 3.

Let and suppose . Using Theorem 4, we get the following results.

Proposition 6. The subdivision scheme generates

In particular, when , generates .

Proof. The symbol of can be written as

where and .
Then, , and .
Moreover, when ,

and when ,

Hence, according to Theorem 4(i), we get that when , the subdivision scheme generates ; when generates and when , generates .

Proposition 7. If applying the parameter shift , the subdivision scheme reproduces

with respect to the parametrization , where denotes the subdivision level. In particular, when , reproduces .

Proof. To consider the reproduction degree of the subdivision scheme , in view of Theorem 4(ii), we just need to consider . Using the notation in Proposition 6, we get that

so , and when ,

Then , and when ,

Hence, using Theorem 4(ii), we conclude that when , the subdivision scheme reproduces ; when reproduces and when , reproduces .

As the new family of subdivision schemes is deduced from the 6-point interpolatory scheme using the relation between 4-point interpolatory scheme and cubic, quintic B-spline, the properties of all of them are summarized in Table 1. For the new subfamily and Hormann-Sabin’s family and both have cubic precision, we list corresponding properties for a comparison in Table 2.

Table 1: Comparison between properties of cubic B-spline refinement, quintic B-spline refinement, 6-point interpolatory scheme, and the new family of schemes , .

Scheme
Support
Continuity
Generation degree
Reproduction degree

4-p interpolatory scheme
6
1
3
3

Cubic B-spline
4
2
3
1

Quintic B-spline
6
4
5
1

6-p interpolatory scheme
10
2
5
5

10
3
3
1

10
4
5
3

10
4
7
3

Table 2: Comparison between properties of Hormann-Sabin’s family , and the new family of schemes .

Scheme
Support
Continuity
Generation degree
Reproduction degree

6
1
3
3

7
2
4
3

8
3
5
3

9
4
6
3

10
5
7
3

11
6
8
3

3

10
4
5
3

10
4
7
3

5. Conclusions

In this paper, we present a new family of 6-point combined subdivision schemes which provides the representation of wide variety of shapes and a subfamily of subdivision schemes with high smoothness and cubic precision. All these properties are required in many applications, such as computer aided geometric design and geometric modeling. The subfamily attains cubic precision whereas the B-spline schemes have linear precision (see Figure 3). On the other hand, both having cubic precision, Hormann-Sabin’ family increases the degree of polynomial generation and smoothness in exchange of the increase of the support width, while can keep the support width unchanged and maintain higher degree of polynomial generation and smoothness. Moreover, the tension parameter makes able to provide more choices in applications (see Figures 4 and 5).

(a)

(b)

Figure 3: The polynomial reproduction property of with (a) and (b) . The blue is the initial control polygon.

(a)

(b)

Figure 4: Comparison of limit curves (the blue curves) generated by (a) 4-p interpolatory scheme, cubic B-spline, and quintic B-spline refinement from outer to inner part and (b) 6-p interpolatory scheme, and , from outer to inner part. The red is the initial control polygon.

(a)

(b)

Figure 5: Comparison of limit curves generated by (a) with from outer to inner part and (b) with from outer to inner part. The red is the initial control polygon.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work is supported by the National Natural Science Foundation of China under Grant nos. 61472466 and 61070227, the NSFC-Guangdong Joint Foundation Key Project under Grant no. U1135003, and the Fundamental Research Funds for the Central Universities under Grant no. JZ2015HGXJ0175.

References

N. Dyn, D. Levin, and J. A. Gregory, “A 4-point interpolatory subdivision scheme for curve design,” Computer Aided Geometric Design, vol. 4, no. 4, pp. 257–268, 1987.

A. Weissman, A 6-point interpolatory subdivision scheme for curve design [M.S. thesis], Tel-Aviv University, 1989.

G. M. Chaikin, “An algorithm for high-speed curve generation,” Computer Graphics and Image Processing, vol. 3, no. 4, pp. 346–349, 1974.

E. Cohen, T. Lyche, and R. Riesenfeld, “Discrete B- splines and subdivision techniques in computer-aided geometric design and computer graphics,” Computer Graphics & Image Processing, vol. 14, no. 2, pp. 87–111, 1980.

J. Maillot and J. Stam, “A unified subdivision scheme for polygonal modeling,” Computer Graphics Forum, vol. 20, no. 3, pp. 471–479, 2001.

G. Li and W. Ma, “A method for constructing interpolatory subdivision schemes and blending subdivisions,” Computer Graphics Forum, vol. 26, no. 2, pp. 185–201, 2007.

S. Lin, F. You, X. Luo, and Z. Li, “Deducing interpolatory subdivision schemes from approximating subdivision schemes,” in Proceedings of the SIGGRAGH Asia’ 08: ACM SIGGRAGH Asia 2008 Papers, pp. 1–7, ACM, New York, NY, USA.

L. Romani, “From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms,” Journal of Computational and Applied Mathematics, vol. 224, no. 1, pp. 383–396, 2009.

C. Conti, L. Gemignani, and L. Romani, “From symmetric subdivision masks of Hurwitz type to interpolatory subdivision masks,” Linear Algebra and its Applications, vol. 431, no. 10, pp. 1971–1987, 2009.

C. Conti, L. Gemignani, and L. Romani, “Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes,” in Proceedings of the 2010 International SYMposium on SYMbolic and Algebraic Computation, pp. 251–256, ACM, 2010.

C. V. Beccari, G. Casciola, and L. Romani, “A unified framework for interpolating and approximating univariate subdivision,” Applied Mathematics and Computation, vol. 216, no. 4, pp. 1169–1180, 2010.

C. Conti, L. Gemignani, and L. Romani, “A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines,” Advances in Computational Mathematics, vol. 39, no. 2, pp. 395–424, 2013.

J. Pan, S. Lin, and X. Luo, “A combined approximating and interpolating subdivision scheme with C² continuity,” Applied Mathematics Letters, vol. 25, no. 12, pp. 2140–2146, 2012.

X. Li and J. Zheng, “An alternative method for constructing interpolatory subdivision from approximating subdivision,” Computer Aided Geometric Design, vol. 29, no. 7, pp. 474–484, 2012.

Z. Luo and W. Qi, “On interpolatory subdivision from approximating subdivision scheme,” Applied Mathematics and Computation, vol. 220, pp. 339–349, 2013.

K. Hormann and M. A. Sabin, “A family of subdivision schemes with cubic precision,” Computer Aided Geometric Design, vol. 25, no. 1, pp. 41–52, 2008.

N. Dyn and D. Levin, “Subdivision schemes in geometric modelling,” Acta Numerica, vol. 11, pp. 73–144, 2002.

C. Conti and K. Hormann, “Polynomial reproduction for univariate subdivision schemes of any arity,” Journal of Approximation Theory, vol. 163, no. 4, pp. 413–437, 2011.

L. Romani, “A Chaikin-based variant of Lane-Riesenfeld algorithm and its non-tensor product extension,” Computer Aided Geometric Design, vol. 32, pp. 22–49, 2015.

M. Charina and C. Conti, “Polynomial reproduction of multivariate scalar subdivision schemes,” Journal of Computational and Applied Mathematics, vol. 240, pp. 51–61, 2013.