Next Article in Journal
Evolutionary Selection of a Set of Association Rules Considering Biological Constraints Describing the Prevalent Elements in Bacterial Vaginosis
Previous Article in Journal / Special Issue
On the Fluctuations of Internal DLA on the Sierpinski Gasket Graph
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convexity-Preserving Rational Cubic Zipper Fractal Interpolation Curves and Surfaces

Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2023, 28(3), 74; https://doi.org/10.3390/mca28030074
Submission received: 5 March 2023 / Revised: 25 May 2023 / Accepted: 8 June 2023 / Published: 10 June 2023
(This article belongs to the Special Issue Geometry of Deterministic and Random Fractals)

Abstract

:
A class of zipper fractal functions is more versatile than corresponding classes of traditional and fractal interpolants due to a binary vector called a signature. A zipper fractal function constructed through a zipper iterated function system (IFS) allows one to use negative and positive horizontal scalings. In contrast, a fractal function constructed with an IFS uses positive horizontal scalings only. This article introduces some novel classes of continuously differentiable convexity-preserving zipper fractal interpolation curves and surfaces. First, we construct zipper fractal interpolation curves for the given univariate Hermite interpolation data. Then, we generate zipper fractal interpolation surfaces over a rectangular grid without using any additional knots. These surface interpolants converge uniformly to a continuously differentiable bivariate data-generating function. For a given Hermite bivariate dataset and a fixed choice of scaling and shape parameters, one can obtain a wide variety of zipper fractal surfaces by varying signature vectors in both the x direction and y direction. Some numerical illustrations are given to verify the theoretical convexity results.

1. Introduction

The technique of constructing fractal interpolation functions (FIFs) initiated by Barnsley [1] can produce nonsmooth or smooth interpolants [2], where the graph of an FIF is an attractor of a suitable IFS. This technique involves a free parameter to control the variation of ordinates so that it provides flexibility to generate a range of interpolants from smooth to nowhere differentiable on a compact domain. A class of spline interpolants can be generalized using the class of smooth fractal interpolants. Implementing the idea of spline FIFs given by Barnsley and Harrington [2], cubic spline FIFs with general boundary conditions were introduced by Chand and Kapoor [3]. Since the classical splines are used in the problem of shape-preserving interpolation, it is natural to think that their fractal generalization can also do the same. Chand et al. in [4] introduced rational cubic FIFs, which can preserve the fundamental features of univariate Hermite data.
In the literature, univariate FIFs are studied more than fractal interpolation surfaces (FISs). It may be the case that the graph of a linear FIS is not continuous [5], whereas the graph of a linear fractal interpolation function (one-dimensional) is always continuous [1]. Massopust [6] proposed the construction of FISs on triangular domains. He used coplanar interpolation points on the boundary of the domain for constructing the FISs. Geronimo and Hardin in [7] presented the constructions of FISs on flexible domains. Zhao [8] generalized that construction using barycentric co-ordinates. In [9,10], the researchers generated FISs on rectangular grids for collinear interpolation points on the boundary. The construction of an FIS given in [10] was improved in [9]. A new construction for FISs for every set of data and a generalization to higher dimensions is given in [11]. FISs with recurrent IFSs were constructed in [12,13]. Navascués et al., in [14], analyzed the spanning properties of the fractal functions on the rectangle. Chand et al., in [15], investigated FISs that lie above a plane. Fractal surfaces have been found to be effective in scientific applications, such as metallurgy, geology, computer graphics, physics, brain electrical activity, and image processing, e.g., [16,17,18,19].
The idea of a zipper, which generalizes the concept of an IFS using a binary vector named signature, was given by Aseev et al. in [20]. Tetenov and collaborators studied many interesting topological and structural properties of zippers related to dendrites and self-similar continua in [21,22,23,24,25]. Chand et al. in [26] generated affine zipper FIFs and examined their range-restricted properties. Recently, the approximation features of smooth zipper fractal functions have been studied in [27]. In this article, we construct one-dimensional and two-dimensional continuously differentiable zipper fractal interpolants. To construct a class of continuously differentiable zipper fractal surface interpolants, we use the technique given in [28], where the horizontal scalings in the x and y directions can be negative. This technique of constructing surface interpolants using the network of univariate boundary curves and blending functions is beneficial in the design environment. Since the generated surface inherits all the properties of the network of boundary curves, see [29], we generate convexity-preserving surface interpolants using some restriction on the zipper IFS parameters. Our scheme can produce a wide variety of surface interpolants due to the presence of a signature, scaling factors, and shape parameters. It is more convenient to model smooth convex bivariate interpolants in shape abstraction and modeling, computer-aided design, biomedical instruments, object recognition, computer graphics, reverse engineering material science, and metallurgy to capture the irregularities associated with the partial derivatives of the surface interpolants.

2. Basics of Fractal Interpolation

We shall begin with the basics of fractal interpolation, and fractal perturbation of a function through α -fractal functions. The details can be found in the references [1,2,30].
Consider a finite interpolation dataset { ( x i , y i ) R 2 : i N N : = { 1 , 2 , , N } } , where x 1 < x 2 < < x N and N > 2 . Let I : = [ x 1 , x N ] and I i : = [ x i , x i + 1 ] for i N N 1 . Let L i : I I i be homeomorphisms such that for all x , x * I and for some 0 l i < 1 ,
| L i ( x ) L i ( x * ) | l i   | x x * | ;   L i ( x 1 ) = x i ,   L i ( x N ) = x i + 1 ,   i N N 1 .
Define N 1 continuous maps F i : I × R R such that
| F i ( x , y ) F i ( x , y * ) | | α i |   | y y * | ;   F i ( x 1 , y 1 ) = y i ,   F i ( x N , y N ) = y i + 1 ,   i N N 1 ,
for all x I , y , y * R , and for some α i ( 1 , 1 ) . Now construct the elementary functions
W i : I × R I i × R I × R ,   W i ( x , y ) = L i ( x ) , F i ( x , y ) ,   i N N 1 .
Theorem 1
([1]). The iterated function system (IFS) { I × R ; W i , i N N 1 } has a unique attractor G , which is the graph of a continuous function g * : I R satisfying g * ( x i ) = y i for all i. Furthermore, if C ^ ( I ) : = { g : I R , g   is   continuous   on   I , g ( x 1 ) = y 1 , g ( x N ) = y N } is endowed with the uniform metric, and the Read–Bajraktarević (RB) operator T α : C ^ ( I ) C ^ ( I ) is defined by T α g ( x ) = F i L i 1 ( x ) , g L i 1 ( x ) , x I i , i N N 1 , then g * is the unique fixed point of T α .
The function g * in the above theorem is called an FIF corresponding to the interpolation dataset { ( x i , y i ) I × R : i = 1 , 2 , , N } . The popular fractal interpolation in theory and applications is taken from the following IFS:
{ I × R ; W i = L i ( x ) , F i ( x , y ) , i N N 1 } ;   L i ( x ) = a i x + b i ,   F i ( x , y ) = α i y + q i ( x ) .
Here, α i is called the vertical scaling factor corresponding to the map W i . The corresponding fractal function g * satisfies
g * ( x ) = α i L i 1 ( x ) g * L i 1 ( x ) + q i L i 1 ( x ) ,   x I i ,   i N N 1 .
Let C k ( I ) be a collection of all k-times continuously differentiable real-valued functions on I. The existence of differentiable fractal functions or spline FIFs is given in the following:
Theorem 2
([2]). Let { ( x i , y i ) , i = 1 , 2 , , N } be a given dataset, where x 1 < < x N . Suppose that L i ( x ) = a i x + b i , F i ( x , y ) = α i y + q i ( x ) , where q i is continuous for i N N 1 . Suppose for some integer p 0 , | α i | < a i p ,   i N N 1 . Let F i k ( x , y ) = α i y + q i ( k ) ( x ) a i k , q i ( k ) ( x ) represents the k t h derivative of q i ( x ) ,
y 1 k = q 1 ( k ) ( x 1 ) a 1 k α 1 ,   y N k = q N 1 ( k ) ( x N ) a N 1 k α N 1 ,   k = 1 , 2 , , p .
I f   F i k ( x N , y N k ) = F i + 1 k ( x 1 , y 1 k ) ,   i N N 2 ,   k = 1 , 2 , , p ,
then the IFS { I × R ; W i ( x , y ) = L i ( x ) , F i ( x , y ) ,   i N N 1 } determines a spline FIF g * C p [ x 1 , x N ] , and g * ( k ) is the FIF determined by { I × R ; W i ( x , y ) = L i ( x ) , F i k ( x , y ) ,   i N N 1 } .
If q i ( x ) ’s are taken as rational functions, one can obtain rational fractal splines, see for instance [4,31].
The concept of FIFs can be used to associate a family of continuous fractal functions with a prescribed function f C ( I ) (see [30]). For this procedure, consider a partition π Δ : = { x 1 , x 2 , , x N } of I with increasing abscissae. Suppose that b C ( I ) satisfies b ( x 1 ) = f ( x 1 ) and b ( x N ) = f ( x N ) . For i N N 1 , we construct q i ( x ) : = f L i ( x ) α i b ( x ) , and then the corresponding RB-operator provides a fixed point denoted by f Δ , b α = f α , where α = ( α 1 , α 2 , , α N 1 ) ( 1 , 1 ) N 1 . The associate fractal function f α is called the α -fractal function corresponding to f and it satisfies the self-referential equation:
f α ( x ) = f ( x ) + α i ( f α b ) L i 1 ( x ) ,   x I i ,   i N N 1 .
This model is used to construct a fractal perturbation of any standard function in numerical analysis and approximation theory.
For a C p ( I ) -fractal perturbation function f α from a germ f in the same space, we proceed as follows: Let f C p ( I ) , and | α i |   <   a i p , i N N 1 . In order to construct f α C p ( I ) corresponding to f, it is sufficient to find the conditions on the base function b according to Theorem 2.
Theorem 3
([32]). Let f C p ( I ) , and x 1 < x 2 < < x N be an arbitrary partition of I. Suppose | α i | < a i p for all i N N 1 . Further, assume that the base function b obeys
b ( k ) ( x 1 ) = f ( k ) ( x 1 ) ,   b ( k ) ( x N ) = f ( k ) ( x N )   for   k = 0 , 1 , , p .
Then, the corresponding fractal function f α is p-times differentiable, and ( f α ) ( k ) ( x i ) = f ( k ) ( x i ) for i N N ; k = 0 , 1 , , p .
In the next section, we will take f as a zipper rational cubic spline, and then we will perturb it to construct the desired zipper fractal rational cubic spline as f α . Since it is difficult for a zipper fractal spline constructed using a single base function to preserve the shape of the data, we will use a family of base functions satisfying the conditions given in Theorem 3 to perturb a zipper rational cubic spline.

3. Construction of Univariate Hermite Zipper RCS and Its Fractal

A classical spline can be written as a function from the entire interval [ x 1 , x N ] to the subinterval [ x i 1 , x i ] , and the contraction factor is always positive. If the interval is also allowed to map in the reverse direction to any subinterval, i.e., x 1 maps to x i and x N maps to x i 1 , then the horizontal contraction factor will be negative. A classical spline can be extended in this manner using a positive contraction or a negative contraction in each subinterval. Thus, we need a binary signature to fulfill such options, and hence the zipper. We construct a family of novel continuously differentiable zipper rational cubic splines (RCSs) using a binary vector signature in Section 3.1 in the first step. The rational cubic spline is a member of this family. In Section 3.2, we generate a new class of continuously differentiable zipper fractal interpolants by fractalizing each member of the family of zipper RCSs using a suitable family of base functions.

3.1. Construction of Hermite Zipper RCS

Consider a finite set of Hermite interpolation data { ( x i , y i , d i ) I × R 2 : i N N } , where y i and d i are the function value and the first derivative value at the knot x i , respectively, I = [ x 1 , x N ] with x 1 < x 2 < < x N . For all i N N , assume that y i [ ϱ 1 , ϱ 2 ] , for some ϱ 1 , ϱ 2 R , and d i are either given or calculated from data by some appropriate methods given in [4]. For a fixed signature ϵ : = ( ϵ 1 , ϵ 2 , , ϵ N 1 ) { 0 , 1 } N 1 , let L i : I I i = [ x i , x i + 1 ] , i = 1 , 2 , , N 1 , be contractive homeomorphisms such that
  L i ( x 1 ) = x i + ϵ i ,   L i ( x N ) = x i + 1 ϵ i ,   L i ( x ) = a i x + b i ,   | L i ( x ) L i ( x * ) | l i | x x * | ,   x , x * I ,
for some 0 l i < 1 .
Let h i * : = x i + 1 ϵ i x i + ϵ i , h i : = x i + 1 x i , Δ i : = y i + 1 y i x i + 1 x i , i N N 1 , and | I | : = x N x 1 . For 0 θ : = x x 1 x N x 1 1 , σ i > 0 , and η i > 0 , let Q i ( θ ) = σ i ( 1 θ ) 2 + 2 σ i η i ( 1 θ ) θ + η i θ 2 . Now, consider a rational function with a cubic numerator and a quadratic denominator of the form:
R ϵ ( L i ( x ) ) = R i ( θ ) Q i ( θ ) ,   i N N 1 ,   x I ,
where
  R i ( θ ) = k = 0 3 A i k ( 1 θ ) 3 k θ k ,   A i 0 = σ i y i + ϵ i ,   A i 1 = ( 2 σ i η i + σ i ) y i + ϵ i + σ i h i * d i + ϵ i ,   A i 2 = ( 2 σ i η i + η i ) y i + 1 ϵ i η i h i * d i + 1 ϵ i ,   A i 3 = η i y i + 1 ϵ i .
One can easily obtain the following results:
Theorem 4.
Let { ( x i , y i , d i ) I × R 2 : i N N } be a Hermite interpolation dataset. For the fixed signature ϵ : = ( ϵ 1 , ϵ 2 , , ϵ N 1 ) { 0 , 1 } N 1 , the rational function R ϵ defined in (5) has the following properties:
(i) 
R ϵ is a member of the space C 1 ( I ) ;
(ii) 
R ϵ interpolates the given Hermite data, i.e., R ϵ ( x i ) = y i and R ϵ ( x i ) = d i for all i N N .
We call this rational function R ϵ as zipper RCS for the given Hermite data. These σ i and η i , i N N 1 , which we used to construct Hermite zipper RCS, are called shape parameters, and we call σ = ( σ 1 , σ 2 , , σ N 1 ) and η = ( η 1 , η 2 , , η N 1 ) shape parameter vectors. For the given Hermite interpolation data { ( x i , y i , d i ) I × R 2 : i N N } , if we take σ i and η i such that σ i η i for all i N N 1 , then using different values of signature (we have 2 N 1 number of choices to choose a signature), one can construct 2 N 1 distinct Hermite zipper RCSs. The proposed class of these Hermite zipper RCSs takes the classical rational cubic spline (when ϵ 0 ) defined in [33] and the piecewise zipper cubic polynomial (when σ i = η i = 1 , i ) as particular cases.

3.2. Construction of a C 1 -RCS ZFIF

In this subsection, we generate α -fractal functions corresponding to R ϵ using Theorem 3.
For a fixed signature ϵ : = ( ϵ 1 , ϵ 2 , , ϵ N 1 ) { 0 , 1 } N 1 , let R ϵ defined in (5) be a zipper RCS for the given Hermite interpolation data { ( x i , y i , d i ) I × R 2 : i N N } . Consider a set of C 1 -functions { B i : i N N 1 } such that
B i ( x ) = R i * ( θ ) Q i ( θ ) ,   i N N 1 ,
where
  R i * ( θ ) = k = 0 3 A i k * ( 1 θ ) 3 k θ k ,   A i 0 * = σ i y 1 ,   A i 1 * = ( 2 σ i η i + σ i ) y 1 + σ i | I | d 1 ,   A i 2 * = ( 2 σ i η i + η i ) y N η i | I | d N ,   A i 3 * = η i y N .
Easily, we can obtain B i ( x k ) = y k and B i ( x k ) = d k for k = 1 , N . We can take this family of base functions B i , i N N 1 to construct N 1 continuous functions F i : K : = I × [ ϱ 1 , ϱ 2 ] R such that
F i ( x , y ) = α i y + R ϵ ( L i ( x ) ) α i B i ( x ) ,
where 1 < α i < 1 . For each i N N 1 , we have
  F i ( x 1 , y 1 ) = y i + ϵ i ,   F i ( x N , y N ) = y i + 1 ϵ i ,   | F i ( x , y ) F i ( x , y * ) | | α i | | y y * | ,   x I , y , y * [ ϱ 1 , ϱ 2 ] .
Define mappings W i : K I i × R , i = 1 , 2 , , N 1 by
W i ( x , y ) = L i ( x ) , F i ( x , y ) , ( x , y ) K .
Definition 1.
Let X be a complete metric space. For given vertices v 1 , v 2 , , v N X and signature ϵ = ( ϵ 1 , ϵ 2 , , ϵ N 1 ) { 0 , 1 } N 1 , a zipper IFS is a collection of X with some contraction maps on X to itself, which is denoted by I : = { X ; Z i : i N N 1 } , where Z i ( v 1 ) = v i + ϵ i and Z i ( v N ) = v i + 1 ϵ i for all i N N 1 . The compact set G X , which satisfies
G = N 1 i = 1 Z i ( G ) ,
is called the attractor or fractal corresponding to the zipper IFS I .
Since K : = I × [ ϱ 1 , ϱ 2 ] is a complete metric space with the usual metric and each W i is a contraction mapping such that W i ( x 1 , y 1 ) = ( x i + ϵ i , y i + ϵ i ) and W i ( x N , y N ) = ( x i + 1 ϵ i , y i + 1 ϵ i ) , then I = { K ; W i : i N N 1 } becomes a zipper IFS with vertices ( x 1 , y 1 ) , ( x 2 , y 2 ) , , ( x N , y N ) and signature ϵ = ( ϵ 1 , ϵ 2 , , ϵ N 1 ) . Since R ϵ and B i for each i N N 1 belong to C 1 ( I ) and agree on the endpoints of subinterval I, if we choose | α i |   <   | a i | , then the zipper IFS I determines a unique attractor G , which is a graph of a continuously differentiable function, say R ϵ α , on I. R ϵ α interpolates the given Hermite data, i.e., R ϵ α ( x i ) = y i and R ϵ α ( 1 ) ( x i ) = d i for all i = 1 , 2 , , N , see [27]. We name this R ϵ α as a rational cubic spline zipper fractal interpolation function (RCS ZFIF). It can also be called α -fractal function corresponding to R ϵ . One can observe that R ϵ α is a unique fixed point of the RB operator T ϵ α : C 1 ^ ( I ) C 1 ^ ( I ) defined as
T ϵ α g ( L i ( x ) ) = R ϵ ( L i ( x ) ) + α i g ( x ) B i ( x ) ,   x I ,   i = 1 , 2 , , N 1 ,
which is a contraction map on C 1 ^ ( I ) , where C 1 ^ ( I ) : = { g C 1 ( I ) : g ( x 1 ) = y 1 , g ( x N ) = y N , g ( x 1 ) = d 1 ,   and   g ( x N ) = d N } is a closed subspace of a complete metric space C 1 ( I ) with respect to C 1 -norm. Therefore, R ϵ α C 1 ( I ) and satisfies
R ϵ α ( L i ( x ) ) = R ϵ ( L i ( x ) ) + α i R ϵ α ( x ) B i ( x ) ,   x I ,   i = 1 , 2 , , N 1 .
From (9), one can deduce that R ϵ α interpolates the given Hermite data. The class of RCS ZFIFs generalizes the class of Hermite zipper RCSs defined in (5) and the class of rational cubic spline fractal interpolation functions (RCS FIFs).
Example 1.
Consider a univariate Hermite interpolation dataset
{ ( 2 , 1 , 3 ) , ( 1 , 2 , 1 ) , ( 0 , 2 , 2 ) , ( 1 , 1 , 1 ) , ( 2 , 3 , 4 ) } .
Using the parameters given in Table 1, we plotted the proposed univariate interpolants in Figure 1a–f. In Figure 1a–c, we generated zipper RCSs using different values of signature with the same values of shape parameters. One can notice that these zipper RCSs are different functions. Since we have 2 5 1 = 16 choices to choose a signature for the given data, we can construct 16 different zipper RCSs. Hence, the class of zipper RCSs extends the class of classical RCSs. Taking ϵ = ( 0 , 0 , 0 , 0 ) , we constructed the classical RCS in Figure 1c. To show the effects of shape parameters, we constructed Figure 1a,d using different values of σ 1 only. From their plots, it can be observed that, if we take a large value of shape parameter on some subinterval, then the corresponding plot on that subinterval becomes nearly a straight line. Figure 1e,f are the graphs of the RCS ZFIFs. We have plotted these graphs using different values of α 3 , and one can notice the changes in subinterval [ 0 , 1 ] .

4. Convexity Preserving Zipper RCS and RCS ZFIF

For a convex Hermite dataset { ( x i , y i , d i ) : i = 1 , 2 , , N } , where d 1 < Δ 1 < < d i < Δ i < d i + 1 < Δ i + 1 < < Δ N 1 < d N , first we will derive sufficient conditions on the shape parameters so that the corresponding zipper rational cubic spline R ϵ becomes convex on I. Then, we will give sufficient conditions on the zipper IFS parameters so that the proposed RCS ZFIF R ϵ α becomes convex on I. Since the first derivative of the proposed RCS ZFIF can be nowhere differentiable on I, to prove the convexity of the RCS ZFIF, we will show that its right-handed double derivative or the left-handed double derivative on each point of the interpolating interval exists and is non-negative.
Proposition 1
([34]). For a continuous function g on I = [ x 1 , x N ] and for each x ( x 1 , x N ) , if one of the one-sided derivatives g ( 1 ) ( x + ) or g ( 1 ) ( x ) exists, and is non-negative (can be + ), then the continuous function g is monotonically increasing on I.
We use the above proposition for the first derivative of the proposed interpolant to preserve the convexity feature of the data.
Theorem 5.
Let { ( x i , y i , d i ) : i = 1 , 2 , , N } be a convex Hermite dataset, where d 1 < Δ 1 < < d i < Δ i < d i + 1 < Δ i + 1 < < Δ N 1 < d N . For a fixed signature ϵ { 0 , 1 } N 1 , if the shape parameters are chosen such that
σ i > max 0 , d i + 1 ϵ i Δ i 2 ( Δ i d i + ϵ i ) ,   η i > max 0 , Δ i d i + ϵ i 2 ( d i + 1 ϵ i Δ i ) ,   i = 1 , 2 , , N 1 ,
then the corresponding zipper RCS will be convex on I.
Proof. 
From the construction (5), R ϵ ( 2 ) may be discontinuous at the internal grids. In addition, R ϵ ( 2 ) ( x i ) and R ϵ ( 2 ) ( x i + ) exist but may be R ϵ ( 2 ) ( x i ) R ϵ ( 2 ) ( x i + ) . Therefore, to prove R ϵ is convex, it is enough to show that min { R ϵ ( 2 ) ( x ) , R ϵ ( 2 ) ( x i + ) , R ϵ ( 2 ) ( x i + 1 ) : x ( x i , x i + 1 ) } 0 for each i N N 1 . Let the shape parameters satisfy the assumptions given in the statement. Now, differentiating twice R ϵ given in (5), we obtain
R ϵ ( 2 ) ( L i ( x ) ) = k = 0 5 D ˚ i k ( 1 θ ) 5 k θ k h i * Q i 3 ( θ ) ,   i N N 1 ,
where
  D ˚ i 0 = 4 η i σ i 3 ( Δ i d i + ϵ i ) + 2 η i σ i 2 ( Δ i d i + 1 ϵ i ) ,   D ˚ i 1 = 8 η i σ i 3 ( Δ i d i + ϵ i ) + 4 η i σ i 2 ( Δ i d i + 1 ϵ i ) + 6 η i σ i 2 ( Δ i d i + ϵ i ) ,   D ˚ i 2 = 6 η i 2 σ i ( d i + 1 ϵ i Δ i ) + 4 η i σ i 3 ( Δ i d i + ϵ i ) + 12 η i σ i 2 ( Δ i d i + ϵ i ) + 2 η i σ i 2 ( Δ i d i + 1 ϵ i ) ,   D ˚ i 3 = 6 η i σ i 2 ( Δ i d i + ϵ i ) + 4 η i 3 σ i ( d i + 1 ϵ i Δ i ) + 12 η i 2 σ i ( d i + 1 ϵ i Δ i ) + 2 η i 2 σ i ( d i + ϵ i Δ i ) ,   D ˚ i 4 = 8 η i 3 σ i ( d i + 1 ϵ i Δ i ) + 4 η i 2 σ i ( d i + ϵ i Δ i ) + 6 η i 2 σ i ( d i + 1 ϵ i Δ i ) ,   D ˚ i 5 = 4 η i 3 σ i ( d i + 1 ϵ i Δ i ) + 2 η i 2 σ i ( d i + ϵ i Δ i ) .
If ϵ i = 0 , then h i * > 0 , and the given assumptions on the shape parameters confirm that Q i 3 > 0 and D ˚ i k 0 for each k = 0 , 1 , , 5 . Therefore, R ϵ ( 2 ) ( L i ( x ) ) 0 for all x I . Similarly, if ϵ i = 1 , then h i * < 0 , and the given assumptions on the shape parameters confirm that Q i 3 > 0 and D ˚ i k 0 for each k = 0 , 1 , , 5 . Therefore, R ϵ ( 2 ) ( L ( x ) ) 0 for all x I and for each i = 1 , 2 , , N 1 . Hence, R ϵ is convex. □
Remark 1.
When ϵ i = 0 for all i N N 1 , the sufficient conditions given in Theorem 5 reduce to sufficient conditions:
σ i > max 0 , d i + 1 Δ i 2 ( Δ i d i ) ,   η i > max 0 , Δ i d i 2 ( d i + 1 Δ i ) ,
for a classical rational cubic interpolant defined in [33] to be convex for given convex interpolation data.
Now, using the convexity of R ϵ , we will show that R ϵ α is also convex if the scaling and shape parameters are restricted suitably. We have
R ϵ α ( L i ( x ) ) = α i R ϵ α ( x ) + R i * * ( θ ) Q i ( θ ) ,
where
  R i * * ( θ ) = k = 0 3 C i k ( 1 θ ) 3 k θ k ,   C i 0 = σ i ( y i + ϵ i α i y 1 ) ,   C i 1 = ( 2 σ i η i + σ i ) ( y i + ϵ i α i y 1 ) + σ i ( h i * d i + ϵ i α i | I | d 1 ) ,   C i 2 = ( 2 σ i η i + η i ) ( y i + 1 ϵ i α i y N ) ) η i ( h i * d i + 1 ϵ i α i | I | d N ) ,   C i 3 = η i ( y i + 1 ϵ i α i y N ) .
Theorem 6.
Let { ( x i , y i , d i ) : i = 1 , 2 , , N } be a convex Hermite dataset, where d 1 < Δ 1 < < d i < Δ i < d i + 1 < Δ i + 1 < < Δ N 1 < d N . Let ϵ { 0 , 1 } N 1 be fixed and the shape parameters be chosen as
σ i > max 0 , d i + 1 ϵ i Δ i 2 ( Δ i d i + ϵ i ) ,   η i > max 0 , Δ i d i + ϵ i 2 ( d i + 1 ϵ i Δ i ) ,   i N N 1 .
If we choose scaling factors such that
0 α i < a i 2 min 1 , ν V i , 2 ,   i N N 1 ,
where ν : = min x I { R ϵ ( 2 ) ( x + ) , R ϵ ( 2 ) ( x ) } and V i , 2 > max 0 , max { B i ( 2 ) : x I } , i N N 1 , then the corresponding C 1 -RCS ZFIF R ϵ α will be convex on I.
Proof. 
From the construction (5), it is obvious that the second derivative of R ϵ exists on each x ( x i , x i + 1 ) , i N N 1 , and also, R ϵ 2 ( x i + ) and R ϵ 2 ( x i + 1 ) exist. However, at the endpoints of the subintervals, it can happen that R ϵ 2 ( x i ) R ϵ 2 ( x i + ) . Therefore, using the given assumptions on the shape parameters in Theorem 5, we have min { R ϵ 2 ( x ) , R ϵ 2 ( x i + ) , R ϵ 2 ( x i + 1 ) : x ( x i , x i + 1 ) } 0 . Thus, ν > 0 . For each i N N 1 , B i is infinitely differentiable on I.
Let the zipper IFS parameters satisfy the assumptions given in the statement. To prove R ϵ α is convex, it is enough to prove that ( R ϵ α ) ( 2 ) ( x + ) or ( R ϵ α ) ( 2 ) ( x ) exists and is non-negative (possibly + ) for all x ( x 1 , x N ) (see, Proposition 1). Let 0 α i < a i 2 . From (9), informally, we can write
( R ϵ α ) ( 2 ) ( L i ( x ) ) = R ϵ ( 2 ) ( L i ( x ) ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x ) α i a i 2 B i ( 2 ) ( x ) ,   i N N 1 .
First, we will prove that the assumptions on parameters imply ( R ϵ α ) ( 2 ) ( x 1 + ) 0 and ( R ϵ α ) ( 2 ) ( x N ) 0 .
  • Case 1: Let ϵ 1 = 0 and ϵ N 1 = 0 .
  • Taking i = 1 and x = x 1 in (11), we obtain
    ( R ϵ α ) ( 2 ) ( x 1 + ) = ( 1 α 1 a 1 2 ) 1 [ R ϵ ( 2 ) ( x 1 + ) α 1 a 1 2 B 1 ( 2 ) ( x 1 + ) ] .
  • Now, R ϵ ( 2 ) ( x 1 + ) α 1 a 1 2 B 1 ( 2 ) ( x 1 + ) ν α 1 a 1 2 V 1 , 2 . Thus, α 1 a 1 2 ν V 1 , 2 implies ( R ϵ α ) ( 2 ) ( x 1 + ) 0 .
  • Taking i = N 1 and x = x N , we have
    ( R ϵ α ) ( 2 ) ( x N ) = ( 1 α N 1 a N 1 2 ) 1 [ R ϵ ( 2 ) ( x N ) α N 1 a N 1 2 B N 1 ( 2 ) ( x N ) ] .
  • Similarly, we can obtain ( R ϵ α ) ( 2 ) ( x N ) 0 if α N 1 a N 1 2 ν V N 1 , 2 .
  • Case 2: Let ϵ 1 = 1 and ϵ N 1 = 1 .
  • From (11), we obtain
    ( R ϵ α ) ( 2 ) ( x 1 + ) = R ϵ ( 2 ) ( x 1 + ) + α 1 a 1 2 ( R ϵ α ) ( 2 ) ( x N ) α 1 a 1 2 B 1 ( 2 ) ( x N ) ,
    ( R ϵ α ) ( 2 ) ( x N ) = R ϵ ( 2 ) ( x N ) + α N 1 a N 1 2 ( R ϵ α ) ( 2 ) ( x 1 + ) α N 1 a N 1 2 B N 1 ( 2 ) ( x 1 + ) .
    Adding (12) and (13), we have
    1 α N 1 a N 1 2 ( R ϵ α ) ( 2 ) ( x 1 + ) + 1 α 1 a 1 2 ( R ϵ α ) ( 2 ) ( x N ) =   R ϵ ( 2 ) ( x 1 + ) α 1 a 1 2 B 1 ( 2 ) ( x N ) + R ϵ ( 2 ) ( x N ) α N 1 a N 1 2 B N 1 ( 2 ) ( x 1 + ) .
    If α 1 a 1 2 ν V 1 , 2 and α N 1 a N 1 2 ν V N 1 , 2 , then
    1 α N 1 a N 1 2 ( R ϵ α ) ( 2 ) ( x 1 + ) + 1 α 1 a 1 2 ( R ϵ α ) ( 2 ) ( x N ) 0 .
    This implies either ( R ϵ α ) ( 2 ) ( x 1 + ) 0 or ( R ϵ α ) ( 2 ) ( x N ) 0 . Therefore, if ( R ϵ α ) ( 2 ) ( x 1 + ) 0 , then (13) implies
    ( R ϵ α ) ( 2 ) ( x N ) R ϵ ( 2 ) ( x N ) α N 1 a N 1 2 B N 1 ( 2 ) ( x 1 + ) 0 .
    Similarly, we can prove that if ( R ϵ α ) ( 2 ) ( x N ) 0 , then ( R ϵ α ) ( 2 ) ( x 1 + ) 0 .
  • Case 3: Let ϵ 1 = 0 and ϵ N 1 = 1 .
We have
( R ϵ α ) ( 2 ) ( x 1 + ) = ( 1 α 1 a 1 2 ) 1 R ϵ ( 2 ) ( x 1 + ) α 1 a 1 2 B 1 ( 2 ) ( x 1 + ) ,
( R ϵ α ) ( 2 ) ( x N ) = R ϵ ( 2 ) ( x N ) + α N 1 a N 1 2 ( R ϵ α ) ( 2 ) ( x 1 + ) α N 1 a N 1 2 B N 1 ( 2 ) ( x 1 + ) .
Using the steps from Case 1 and Case 2, we can conclude that ( R ϵ α ) ( 2 ) ( x 1 + ) 0 and ( R ϵ α ) ( 2 ) ( x N ) 0 if α 1 a 1 2 ν V 1 , 2 and α N 1 a N 1 2 ν V N 1 , 2 .
  • Case 4: Let ϵ 1 = 1 and ϵ N 1 = 0 . This case is similar to the previous case.
Thus, we have
( R ϵ α ) ( 2 ) ( x 1 + ) 0   and   ( R ϵ α ) ( 2 ) ( x N ) 0 .
Now, we are moving to the other knots. For a fixed i N N 1 , if ϵ i = 0 , then (11) gives
( R ϵ α ) ( 2 ) ( x i + ) = R ϵ ( 2 ) ( x i + ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x 1 + ) α i a i 2 B i ( 2 ) ( x 1 + ) .
Now, using ( R ϵ α ) ( 2 ) ( x 1 + ) 0 and α i a i 2 ν V i , 2 , we have ( R ϵ α ) ( 2 ) ( x i + ) 0 .
If ϵ i = 1 , we have
( R ϵ α ) ( 2 ) ( x i + 1 ) = R ϵ ( 2 ) ( x i + 1 ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x 1 + ) α i a i 2 B i ( 2 ) ( x 1 + ) .
Similarly, we can obtain ( R ϵ α ) ( 2 ) ( x i + 1 ) 0 using the assumptions on the zipper IFS parameters. Hence, the condition
( R ϵ α ) ( 2 ) ( x 1 + ) 0   and   α i a i 2 ν V i , 2     ( R ϵ α ) ( 2 ) ( x i + ) 0   if   ϵ i = 0 , ( R ϵ α ) ( 2 ) ( x i + 1 ) 0   if   ϵ i = 1   for   i N N 1 .
Similarly,
( R ϵ α ) ( 2 ) ( x N ) 0   and   α i a i 2 ν V i , 2     ( R ϵ α ) ( 2 ) ( x i + ) 0   if   ϵ i = 1 , ( R ϵ α ) ( 2 ) ( x i + 1 ) 0   if   ϵ i = 0   for   i N N 1 .
Therefore, using the given assumptions on the zipper IFS parameters, we have
min ( R ϵ α ) ( 2 ) ( x 1 + ) , ( R ϵ α ) ( 2 ) ( x N ) , ( R ϵ α ) ( 2 ) ( x i ) , ( R ϵ α ) ( 2 ) ( x i + ) : i = 2 , 3 , , N 1 0 .
Now, we are moving to the next iteration. If ϵ i = 0 , we have
  ( R ϵ α ) ( 2 ) ( L i ( x j ) + ) = R ϵ ( 2 ) ( L i ( x j ) + ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x j + ) α i a i 2 B i ( 2 ) ( x j + ) ,   ( R ϵ α ) ( 2 ) ( L i ( x j ) ) = R ϵ ( 2 ) ( L i ( x j ) ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x j ) α i a i 2 B i ( 2 ) ( x j ) , j = 2 , 3 , , N 1 .
If ϵ i = 1 , we have
  ( R ϵ α ) ( 2 ) ( L i ( x j ) + ) = R ϵ ( 2 ) ( L i ( x j ) + ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x j ) α i a i 2 B i ( 2 ) ( x j ) ,   ( R ϵ α ) ( 2 ) ( L i ( x j ) ) = R ϵ ( 2 ) ( L i ( x j ) ) + α i a i 2 ( R ϵ α ) ( 2 ) ( x j + ) α i a i 2 B i ( 2 ) ( x j + ) , j = 2 , 3 , , N 1 .
Using a similar procedure, we have min i N N 1 { ( R ϵ α ) ( 2 ) ( L i ( x j ) + ) , ( R ϵ α ) ( 2 ) ( L i ( x j ) ) : j N N } 0 , provided the parameters satisfy the given assumptions. Similarly, ( R ϵ α ) 2 ( x + ) and ( R ϵ α ) 2 ( x ) exist, and are non-negative on the new points generated in the next iteration. Since ( R ϵ α ) ( 2 ) is determined iteratively, we can conclude that R ϵ α is convex. □
Example 2.
Consider a univariate Hermite interpolation dataset
{ ( 4 , 0 , 0.25 ) , ( 2 , 1 , 1 ) , ( 0 , 4 , 1.8 ) , ( 2 , 8 , 3.2 ) , ( 4 , 15 , 4 ) } .
Clearly, the given Hermite dataset is convex and satisfies d 1 < Δ 1 < d 2 < Δ 2 < d 3 < Δ 3 < d 4 < Δ 4 < d 5 . Using the parameters given in Table 2 and signature ϵ = ( 1 , 1 , 1 , 0 ) , we plotted the proposed interpolants in Figure 2a–c.
We chose random parameters for plotting Figure 2a, and the corresponding RCS ZFIF is not convex, which can be seen from its first derivative plotted in Figure 2d, as it is not monotonically increasing, or it can be seen from its double derivative plotted in Figure 2g, as it takes some negative values.
We used sufficient conditions provided in Theorems 5 and 6 to plot the RCS ZFIF in Figure 2b and zipper RCS in Figure 2c, respectively. From their figures or the plot of their second derivatives in Figure 2h,i, it can be observed that they preserve the convexity of the given data. As the magnitude of each scaling factor is close to zero, the difference between the RCS ZFIF plotted in Figure 2b and zipper RCS plotted in Figure 2c cannot be seen much from their plots, but it can be easily observed from their second derivatives. In addition, one can observe that the second derivative of the RCS ZFIF plotted in Figure 2h does not exist on more points than the second derivative of the zipper RCS plotted in Figure 2i.

5. Construction of Bicubic Partially Blended RCZFIS

In this section, we will generate zipper fractal interpolation surfaces for given Hermite bivariate data Γ : = { ( x i , y j , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } , where x 1 < x 2 < < x N , y 1 < y 2 < < y M , and z i , j x is x-partial and z i , j y is y-partial at the point ( x i , y j ) . First, we split the given Hermite bivariate or surface data into univariate Hermite datasets along the x-axis and the y-axis, i.e., along each j-th grid line parallel to the x-axis and along each i-th grid line parallel to the y-axis, see Figure 3. Thus, we have M number of Hermite datasets Γ y j : = { ( x i , z i , j , z i , j x ) : i N N } along the x-axis and N number of Hermite datasets Γ x i : = { ( y j , z i , j , z i , j y ) : j N M } along the y-axis. Then, we construct RCS ZFIFs using these univariate Hermite datasets. We generate a zipper fractal interpolation surface with the Coons patch technique [28] using these RCS ZFIFs as the boundary curves and blending them with two cubic blending functions. Here, we obtain the advantage of using signature vectors as we can obtain M × N × 2 N + M 2 different zipper fractal interpolation surfaces by varying the values of signature vectors only.
For i N N 1 and j N M 1 , denote I : = [ x 1 , x N ] , I i : = [ x i , x i + 1 ] , J : = [ y 1 , y M ] , J j : = [ y j , y j + 1 ] , R i , j : = I i × J j , R : = I × J = i = 1 N 1 j = 1 M 1 R i , j , h i : = x i + 1 x i , h : = max { h i : i N N 1 } , h ¯ j : = y j + 1 y j , h ¯ : = max { h ¯ j : j N M 1 } , Δ i j : = z i + 1 , j z i , j x i + 1 x i , and Δ ¯ j i : = z i , j + 1 z i , j y j + 1 y j . For fixed j N M , consider the univariate Hermite data Γ y j . Let the signature corresponding to the dataset Γ y j denoted by ϵ j = ( ϵ 1 j , ϵ 2 j , , ϵ N 1 j ) { 0 , 1 } N 1 be fixed. For each i N N 1 , let L i j : [ x 1 , x N ] [ x i , x i + 1 ] be a contractive homeomorphism such that L i j ( x ) = a i j x + b i j satisfying L i j ( x 1 ) = x i + ϵ i j and L i j ( x N ) = x i + 1 ϵ i j , α i j be a scaling factor such that | α i j |   <   | a i j | , σ i j and η i j > 0 be the shape parameters, h i j : = x i + 1 ϵ i j x i + ϵ i j , and B i j be a base function. Using these notations in Section 3, the RCS ZFIF corresponding to the univariate Hermite data Γ y j denoted by N ϵ j α j can be written as
N ϵ j α j ( x ) = N ϵ j ( x ) + α i j N ϵ j α j ( L i j ) 1 ( x ) B i j ( L i j ) 1 ( x ) ,   x I i ,   i N N 1 ,
where N ϵ j is the univariate Hermite zipper RCS that interpolates the data Γ y j . Thus,
N ϵ j α j ( x i ) = N ϵ j ( x i ) = z i , j ,   d N ϵ j α j ( x i ) d x = d N ϵ j ( x i ) d x = z i , j x ,   j N M ,   i N N .
By fixing the signature ϵ j for each univariate dataset Γ y j , j N M , we can generate a RCS ZFIF, which interpolates Γ y j , i.e., we can construct M number of RCS ZFIFs along the x-axis.
Similarly, we construct RCS ZFIFs along the y-axis. For fixed i N N , consider the univariate Hermite data Γ x i = { ( y j , z i , j , z i , j y ) : j N M } . Let the signature corresponding to the data Γ x i denoted by ϵ ¯ i = ( ϵ ¯ 1 i , ϵ ¯ 2 i , , ϵ ¯ M 1 i ) { 0 , 1 } M 1 be fixed. For each j N M 1 , let L ¯ j i : [ y 1 , y M ] [ y j , y j + 1 ] be a contractive homeomorphism such that L ¯ j i ( y ) = a ¯ j i y + b ¯ j i satisfying L ¯ j i ( y 1 ) = y j + ϵ ¯ j i and L ¯ j i ( y M ) = y j + 1 ϵ ¯ j i , α ¯ j i be a scaling factor such that | α ¯ j i |   <   | a ¯ j i | , σ ¯ j i and η ¯ j i > 0 be the shape parameters, h ¯ j i : = y j + 1 ϵ ¯ j i y i + ϵ ¯ j i , and B ¯ j i be a base function. Now, the RCS ZFIF corresponding to the univariate Hermite data Γ x i denoted by N ¯ ϵ ¯ i α ¯ i can be written as
N ¯ ϵ ¯ i α ¯ i ( y ) = N ¯ ϵ ¯ i ( y ) + α ¯ j i N ¯ ϵ ¯ i α ¯ i ( L ¯ j i ) 1 ( y ) B ¯ j i ( L ¯ j i ) 1 ( y ) ,   y J j ,   j N M 1 ,
where N ¯ ϵ ¯ i is the univariate Hermite zipper RCS that interpolates the data Γ x i . Thus,
N ¯ ϵ ¯ i α ¯ i ( y j ) = N ¯ ϵ ¯ i ( y j ) = z i , j ,   d N ¯ ϵ ¯ i α ¯ i ( y j ) d y = d N ¯ ϵ ¯ i ( y j ) d y = z i , j y ,   i N N ,   j N M .
Now, for the boundary of subrectangle R i , j = [ x i , x i + 1 ] × [ y j , y j + 1 ] , we have four curves (two along the i-th and i + 1 -th grid lines and two along the j-th and j + 1 -th grid lines) N ϵ j α j ( x ) | [ x i , x i + 1 ] , N ϵ j + 1 α j + 1 ( x ) | [ x i , x i + 1 ] , N ¯ ϵ ¯ i α ¯ i ( y ) | [ y j , y j + 1 ] , and N ¯ ϵ ¯ i + 1 α ¯ i + 1 ( y ) | [ y j , y j + 1 ] . Using the transfinite interpolation method via blending functions, we can define the surface F ϵ α of the form:
F ϵ α ( x , y ) = F ϵ , 1 α ( x , y ) + F ϵ , 2 α ( x , y ) F ϵ , 3 α ( x , y ) ,   x I i ,   y J j ,   i N N 1 ,   j N M 1 ,
where
  F ϵ , 1 α ( x , y ) : = Ω 0 μ i * ( x ) N ¯ ϵ ¯ i α ¯ i ( y ) + Ω 1 μ i * ( x ) N ¯ ϵ ¯ i + 1 α ¯ i + 1 ( y ) ,   F ϵ , 2 α ( x , y ) : = Ω 0 μ ¯ j ( y ) N ϵ j α j ( x ) + Ω 1 μ ¯ j ( y ) N ϵ j + 1 α j + 1 ( x ) ,   F ϵ , 3 α ( x , y ) : = Ω 0 μ i * ( x ) Ω 0 μ ¯ j ( y ) z i , j + Ω 0 μ i * ( x ) Ω 1 μ ¯ j ( y ) z i , j + 1       + Ω 1 μ i * ( x ) Ω 0 μ ¯ j ( y ) z i + 1 , j + Ω 1 μ i * ( x ) Ω 1 μ ¯ j ( y ) z i + 1 , j + 1 ,   μ i * ( x ) = x x i x i + 1 x i ,   μ ¯ j ( y ) = y y j y j + 1 y j ,   Ω 0 ( μ ) : = ( 1 μ ) 2 ( 1 + 2 μ ) ,   Ω 1 ( μ ) : = μ 2 ( 3 2 μ ) .
In (24), F ϵ , 1 α and F ϵ , 2 α each generates a surface using two boundary curves by blending these curves with cubic functions. F ϵ , 1 α uses N ϵ ¯ i α ¯ i ( y ) and N ϵ ¯ i + 1 α ¯ i + 1 ( y ) , and F ϵ , 2 α uses another two curves N ϵ j α j ( x ) and N ϵ j + 1 α j + 1 ( x ) . Since we added the corners twice, we used F ϵ , 3 α . These smooth cubic functions Ω 0 and Ω 1 , satisfying
  Ω 0 ( 0 ) = 1 ,   Ω 0 ( 1 ) = 0 ,   Ω 0 ( 0 ) = 0 ,   Ω 0 ( 1 ) = 0 ,   Ω 1 ( 0 ) = 0 ,   Ω 1 ( 1 ) = 1 ,   Ω 1 ( 0 ) = 0 ,   Ω 1 ( 1 ) = 0 ,
are called blending functions as they blend four different univariate functions together on the boundary to produce a well-defined surface.
Theorem 7.
Let { ( x i , y j , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } be a given bivariate Hermite dataset. The bivariate function F ϵ α defined in (24) has the following properties:
(i) 
F ϵ α C 1 ( I × J ) ;
(ii) 
F ϵ α interpolates the given bivariate data, i.e.,
F ϵ α ( x i , y j ) = z i , j ,   F ϵ α x | ( x i , y j ) = z i , j x ,   F ϵ α y | ( x i , y j ) = z i , j y ,   i N N ,   j N M ;
(iii) 
If the given bivariate data { ( x i , y j , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } is taken from a function Ψ C 1 ( I × J ) , then bivariate interpolant F ϵ α converges uniformly to Ψ as h 0 and h ¯ 0 .
Since boundary curves satisfying (20)–(23) and blending functions satisfying (25) are continuously differentiable functions, it is easy to observe that the generated surface F ϵ α holds properties (i) and (ii) given in Theorem 7. Part (iii) of this theorem can be proved in a similar manner as described in [15]. We call the bivariate interpolant F ϵ α a rational cubic zipper fractal interpolation surface (RCZFIS). For each j N M , we can generate 2 N 1 number of different RCS ZFIFs corresponding to the univariate data Γ y j by varying the signature vector ϵ j only. Therefore, we can construct M × 2 N 1 number of RCS ZFIFs along the x-axis. Similarly, we can construct N × 2 M 1 number of RCS ZFIFs along the y-axis. Therefore, we can construct N × M × 2 N + M 2 number of different RCZFISs for the given bivariate data { ( x i , y j , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } by varying the signature vectors only, where all the other parameters are the same. The proposed class of partially blended rational cubic zipper fractal interpolation surfaces generalizes the existing class of partially blended rational cubic fractal interpolation surfaces and partially blended rational cubic interpolation surfaces. If we choose all the scaling factors to be zero, then the bicubic partially blended rational cubic ZFIS (24) reduces to the bicubic partially blended zipper rational cubic surface, and we denote it F ϵ .
Example 3.
For the Hermite surface interpolation data points of the form ( x i , y j , z i , j , z i , j x , z i , j y ) given in Table 3, we constructed different RCZFISs using the different signature vectors given in Table 4 and the fixed shape parameters and scaling function vectors given in Table 5.
In Figure 4a,b, we plotted the RCS ZFIFs along the x-axis and the y-axis. We used them to plot RCZFIS 1 given in Figure 4c. Then, using different signature vectors only, we plotted RCZFIS 2, RCZFIS 3, and RCZFIS 4 in Figure 4d–f, respectively. One can observe that we obtain a different surface when we change the signature. Since for the given surface data of 4 × 4 points, we have 4 × 4 × 2 3 × 2 3 = 1024 choices to choose a signature vector, we can generate 1024 different RCZFISs by changing the values of signature vectors with the fixed sets of shape parameters and scaling functions.

6. Convexity-Preserving RCZFIS

In this section, we will generate convex RCZFISs for a given convex bivariate dataset. Casciola and Romani [29] observed that the bicubic partially blended surface inherits all the properties of the network of boundary curves.
Let Γ = { ( x i , y i , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } be a convex surface data, where
Δ i j < Δ i + 1 j ,   z i , j x < z i + 1 , j x ,   z i , j x < Δ i j < z i + 1 , j x ;   i N N 1 , j N M ,
and
Δ ¯ j i < Δ ¯ j + 1 i ,   z i , j y < z i , j + 1 y ,   z i , j y < Δ ¯ j i < z i , j + 1 y ;   i N N , j N M 1 .
Therefore, the univariate Hermite datasets Γ y j for all j N M and Γ x i for all i N N are also convex. Now, with these notations in Theorem 6, we obtain the following results:
(i)
For fixed j N M , N ϵ j α j is convex if
  σ i j > max 0 , z i + 1 ϵ i j , j x Δ i j 2 Δ i j z i + ϵ i j , j x ,   η i j > max 0 , Δ i j z i + ϵ i j , j x 2 z i + 1 ϵ i j , j x Δ i j ,   0 α i j < a i j 2 min 1 , ( ν ) j V i , 2 j ,   i N N 1 ,
where
( ν ) j : = max N ϵ j ( 2 ) ( x + ) , N ϵ j ( 2 ) ( x ) : x I , V i , 2 j > max 0 , max { B i j ( 2 ) ( x ) : x I } ;
(ii)
For fixed i N N , N ¯ ϵ ¯ i α ¯ i is convex if
  σ ¯ j i > max 0 , z i , j + 1 ϵ ¯ j i y Δ ¯ j i 2 Δ ¯ j i z i , j + ϵ ¯ j i y ,   η ¯ j i > max 0 , Δ ¯ j i z i , j + ϵ ¯ j i y 2 z i , j + 1 ϵ ¯ j i y Δ ¯ j i ,   0 α ¯ j i < a ¯ j i 2 min 1 , ( ν ¯ ) i V ¯ j , 2 i ,   j N M 1 ,
where
( ν ¯ ) i : = max N ¯ ϵ ¯ i ( 2 ) ( y + ) , N ¯ ϵ ¯ i ( 2 ) ( y ) : y J , V ¯ j , 2 i > max 0 , max { B ¯ j i ( 2 ) ( y ) : y J } .
Thus, for the given convex surface data, we can restrict the parameters so that each RCS ZFIF that we used to generate the surface RCZFIS is convex. Hence, using [29], we have the following theorem:
Theorem 8.
For given convex surface data Γ = { ( x i , y i , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } , if the shape parameter vectors and the scaling vectors satisfy (26) and (27) for each i N N and j N M , then the corresponding bicubic partially blended RCZFIS F ϵ α will be convex on R = I × J .
Numerical algorithm for generating a convex RCZFIS for given convex surface data Γ = { ( x i , y i , z i , j , z i , j x , z i , j y ) : i N N ,   j N M } :
  • Step 1: Split Γ into convex univariate Hermite datasets along the x-axis and y-axis.
  • Step 2: Fix the values of signature vectors.
  • Step 3: Choose the shape parameters and scaling factors as restricted in (26) and (27).
  • Step 4: Construct the convexity-preserving univariate RCS ZFIFs along these univariate datasets with the parameters chosen in Step 2 and Step 3.
  • Step 5: Construct a RCZFIS using these convex RCS ZFIFs and cubic blending functions Ω 0 and Ω 1 in (24).
The RCZFIS constructed in Step 5 is a convex surface interpolating the given convex data Γ .
Remark 2.
One can construct concave RCZFISs for given concave surface data with a similar procedure.
Example 4.
We generated convex Hermite surface data on { 1 , 1 3 , 1 3 , 1 } × { 1 , 1 3 , 1 3 , 1 } from a bivariate function Z f ( x , y ) = x 2 + y 2 . We plotted Figure 5a,b using the zipper IFSs parameters given in Table 6. For Figure 5a, we chose random shape parameters and scaling functions, and the corresponding RCZFIS is not convex on [ 1 , 1 ] × [ 1 , 1 ] , which we can observe from its x z -view and y z -view plotted in Figure 5c,e, respectively. However, when we restrict the shape parameters and scaling function as prescribed in Theorem 8, the corresponding RCZFIS plotted in Figure 5b becomes convex on [ 1 , 1 ] × [ 1 , 1 ] , which one can examine from its x z -view and y z -view plotted in Figure 5d,f, respectively.

7. Conclusions

This article introduces a class of novel continuously differentiable surface interpolants (RCZFISs) on a rectangular grid. The proposed surface interpolant is based on 16 parameters (8 shape parameters, 4 scaling factors, and 4 signature components) and two blending functions on each rectangular patch. It was observed that the RCZFIS converges the continuously differentiable data generated function uniformly. It can capture the irregularities associated with the partial derivatives of the data-generating function. For the fixed signature vectors, one can preserve the convexity of the data through RCZFIS using mild conditions on shape parameters and scaling functions. Some numerical examples have been given so the reader can become more familiar with these interpolants. The proposed scheme is more appropriate for modeling smooth convex surfaces with irregular partial derivatives in many areas of science and engineering. In automobile industries, convex and concave surfaces are used extensively for the shape of a vehicle. By varying signature only, one can design a wide variety of vehicles with very much similar shapes based on a variation on 1st order partial derivatives. The existence of minimum energy among C 2 zipper fractal splines, when the scale vector is fixed, is an open problem. The monotonicity- and convexity-preserving zipper fractal surfaces directly from zipper IFSs are open problems. The zipper fractal rational splines can be used as solutions of differential and integral equations if the associated problem contains a continuous and nowhere differentiable function.

Author Contributions

Conceptualization, V. and A.K.B.C.; methodology, V. and A.K.B.C.; software, V.; validation, V. and A.K.B.C.; formal analysis, V.; writing—original draft preparation, V.; writing—review and editing, A.K.B.C.; supervision, A.K.B.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The manuscript does not contain any data from a third party. All of the material is owned by the authors and/or no permissions are required.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Barnsley, M.F. Fractal functions and interpolation. Constr. Approx. 1986, 2, 303–329. [Google Scholar] [CrossRef]
  2. Barnsley, M.F.; Harrington, A.N. The calculus of fractal interpolation functions. J. Approx. Theory 1989, 57, 14–34. [Google Scholar] [CrossRef] [Green Version]
  3. Chand, A.K.B.; Kapoor, G.P. Generalized cubic spline fractal interpolation functions. SIAM J. Numer. Anal. 2006, 44, 655–676. [Google Scholar] [CrossRef] [Green Version]
  4. Chand, A.K.B.; Vijender, N.; Navascués, M.A. Shape preservation of scientific data through rational fractal splines. Calcolo 2014, 51, 329–362. [Google Scholar] [CrossRef]
  5. Massopust, P. Fractal Functions, Fractal Surfaces and Wavelets; Academic Press: San Diego, CA, USA, 1994. [Google Scholar]
  6. Massopust, P. Fractal surfaces. J. Math. Anal. Appl. 1990, 151, 275–290. [Google Scholar] [CrossRef] [Green Version]
  7. Geronimo, J.S.; Hardin, D.P. Fractal Interpolation Surfaces and a Related 2-D Multiresolution Analysis. J. Math. Anal. Appl. 1993, 176, 561–586. [Google Scholar] [CrossRef] [Green Version]
  8. Zhao, N. Construction and application of fractal interpolation surfaces. Vis. Comput. 1996, 12, 132–146. [Google Scholar] [CrossRef]
  9. Dalla, L. Bivariate fractal interpolation function on grids. Fractals 2002, 10, 53–58. [Google Scholar] [CrossRef]
  10. Xie, H.; Sun, H. The study of bivariate fractal interpolation functions and creation of fractal interpolated surfaces. Fractals 1997, 5, 625–634. [Google Scholar] [CrossRef]
  11. Malysz, R. The Minkowski dimension of the bivariate fractal interpolation surfaces. Chaos Solitons Fractals 2006, 27, 1147–1156. [Google Scholar] [CrossRef]
  12. Bouboulis, P.; Dalla, L. Fractlal interpolation surfaces derived from fractal interpolation functions. J. Math. Anal. Appl. 2007, 336, 919–936. [Google Scholar] [CrossRef] [Green Version]
  13. Bouboulis, P.; Dalla, L.; Drakopoulos, V. Construction of recurrent bivariate fractal interpolation surfaces and computation of their box-counting dimension. J. Approx. Theory 2006, 141, 99–117. [Google Scholar] [CrossRef] [Green Version]
  14. Navascués, M.A.; Mohapatra, R.; Akhtar, M.N. Fractal frames of functions on the rectangle. Fractal Fract. 2021, 5, 42. [Google Scholar] [CrossRef]
  15. Chand, A.K.B.; Viswanathan, P.; Vijender, N. Bicubic partially blended rational fractal surface for a constrained interpolation problem. Comp. Appl. Math. 2018, 37, 785–804. [Google Scholar] [CrossRef]
  16. Bouboulis, P.; Dalla, L.; Drakopoulos, V. Image compression using recurrent bivariate fractal interpolation surfaces. J. Bifur. Chaos 2006, 16, 2063–2071. [Google Scholar] [CrossRef] [Green Version]
  17. Campbell, B.A.; Shepard, M.K. Shadows on a planetary surface and implications for photometric roughness. ICARUS 1998, 134, 279–291. [Google Scholar]
  18. Navascués, M.A.; Sebastián, M.V. Fitting fractal surfaces on non-rectangular grids. Fractals 2008, 16, 151–158. [Google Scholar] [CrossRef]
  19. Xie, H.; Sun, H.; Zu, Y.; Feng, Z. Study on generation of rock fracture surfaces by using fractal interpolation. Int. J. Solids Struct. 2001, 38, 5765–5787. [Google Scholar] [CrossRef]
  20. Aseev, V.V.; Tetenov, A.V.; Kravchenko, A.S. On self-similar Jordan curves on the plane. Sib. Math. J. 2003, 44, 379–386. [Google Scholar] [CrossRef]
  21. Aseev, V.V.; Tetenov, A.V. On self-similar Jordan arcs that admit structural parametrization. Sib. Math. J. 2005, 46, 581–592. [Google Scholar] [CrossRef]
  22. Samuel, M.; Tetenov, A.; Vaulin, D. Self-similar dendrites generated by polygonal systems in the plane. Sib. Élektron. Mat. Izv. 2017, 14, 737–751. [Google Scholar]
  23. Tetenov, A.V. On self-similar Jordan arcs on a plane. Sib. Zh. Ind. Mat. 2004, 7, 148–155. [Google Scholar]
  24. Tetenov, A.V. Self-similar Jordan arcs and graph-directed systems of similarities. Sib. Math. J. 2006, 47, 940–949. [Google Scholar] [CrossRef]
  25. Tetenov, A.V.; Samuel, M.; Vaulin, D.A. On dendrites defined by polyhedral systems and their ramification points. Tr. Inst. Mat. Mekh. 2017, 23, 281–291. [Google Scholar]
  26. Chand, A.K.B.; Vijender, N.; Viswanathan, P.; Tetenov, A.V. Affine zipper fractal interpolation functions. BIT Num. Math. 2020, 60, 319–344. [Google Scholar] [CrossRef]
  27. Vijay; Vijender, N.; Chand, A.K.B. Generalized zipper fractal approximation and parameter identification problems. Comp. Appl. Math. 2022, 41, 155. [Google Scholar] [CrossRef]
  28. Farin, G. Curves and Surfaces for CAGD; Morgan Kaufmann: Burlington, MA, USA, 2002. [Google Scholar]
  29. Casciola, G.; Romani, L. Rational interpolants with tension parameters. In Curve and Surface Design: Saint-Malo 2002; Lyche, T., Mazure, M.-L., Schumaker, L.L., Eds.; Nashboro Press: Brentwood, LA, USA, 2003; pp. 41–50. [Google Scholar]
  30. Navascués, M.A. Fractal polynomial interpolation. Z. Anal. Anwend. 2005, 24, 401–418. [Google Scholar] [CrossRef]
  31. Viswanathan, P.; Chand, A.K.B. A C1-rational cubic fractal interpolation function: Convergence and associated parameter identification problem. Acta Appl. Math. 2015, 136, 19–41. [Google Scholar] [CrossRef]
  32. Navascués, M.A.; Sebastián, M.V. Smooth fractal interpolation. J. Inequal. Appl. 2006, 2006, 78734. [Google Scholar] [CrossRef] [Green Version]
  33. Tian, M. Monotonicity preserving piecewise rational cubic interpolation. Int. J. Math. Anal. 2011, 5, 99–104. [Google Scholar]
  34. Miller, A.D.; Vyborny, R. Some Remarks on Functions with One-Sided Derivatives. Amer. Math. Mon. 1986, 93, 471–475. [Google Scholar] [CrossRef]
Figure 1. Univariate interpolants.
Figure 1. Univariate interpolants.
Mca 28 00074 g001aMca 28 00074 g001b
Figure 2. Verification of convexity by RCS ZFIFs. (a) Nonconvex RCS ZFIF. (b) Convex RCS ZFIF. (c) Convex zipper RCS. (d) The first derivative of the RCS ZFIF plotted in Figure 2a. (e) The first derivative of the RCS ZFIF plotted in Figure 2b. (f) The first derivative of the RCS ZFIF plotted in Figure 2c. (g) The second derivative of the zipper RCS plotted in Figure 2a. (h) The second derivative of the zipper RCS plotted in Figure 2b. (i) The second derivative of the zipper RCS plotted in Figure 2c.
Figure 2. Verification of convexity by RCS ZFIFs. (a) Nonconvex RCS ZFIF. (b) Convex RCS ZFIF. (c) Convex zipper RCS. (d) The first derivative of the RCS ZFIF plotted in Figure 2a. (e) The first derivative of the RCS ZFIF plotted in Figure 2b. (f) The first derivative of the RCS ZFIF plotted in Figure 2c. (g) The second derivative of the zipper RCS plotted in Figure 2a. (h) The second derivative of the zipper RCS plotted in Figure 2b. (i) The second derivative of the zipper RCS plotted in Figure 2c.
Mca 28 00074 g002
Figure 3. Splitting bivariate data into univariate datasets.
Figure 3. Splitting bivariate data into univariate datasets.
Mca 28 00074 g003
Figure 4. Zipper fractal network curves and surface interpolants.
Figure 4. Zipper fractal network curves and surface interpolants.
Mca 28 00074 g004
Figure 5. Verification of convexity by RCZFIS.
Figure 5. Verification of convexity by RCZFIS.
Mca 28 00074 g005
Table 1. Zipper IFS parameters for Figure 1.
Table 1. Zipper IFS parameters for Figure 1.
Figure 1 σ η ϵ α
(a) ( 0.1 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 1 , 1 , 0 , 1 ) – –
(b) ( 0.1 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 0 , 1 , 0 , 1 ) – –
(c) ( 0.1 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 0 , 0 , 0 , 0 ) – –
(d) ( 2 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 1 , 1 , 0 , 1 ) – –
(e) ( 2 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 1 , 1 , 0 , 1 ) ( 0.2 , 0.15 , 0.1 , 0.24 )
(f) ( 2 , 0.2 , 0.1 , 0.2 ) ( 1 , 2 , 2 , 1 ) ( 1 , 1 , 0 , 1 ) ( 0.2 , 0.15 , 0.2 , 0.24 )
Table 2. Shape parameters and scaling vectors for Figure 2.
Table 2. Shape parameters and scaling vectors for Figure 2.
Figure 2 σ η α
(a) ( 0.03 , 0.01 , 0.1 , 4 ) ( 1 , 0.02 , 1 , 0.01 ) ( 0.02 , 0.02 , 0.03 , 0.03 )
(b) ( 1 , 2 , 5 , 2 ) ( 2 , 4 , 5 , 3 ) ( 0.01 , 0 , 0.01 , 0.01 )
(c) ( 1 , 2 , 5 , 2 ) ( 2 , 4 , 5 , 3 )
Table 3. Bivariate Hermite data.
Table 3. Bivariate Hermite data.
x / y 1 1 / 3 1 / 3 1
1 ( 3 , 1 , 1 ) ( 1 , 2 , 2 ) ( 2 , 12 , 3 ) ( 5 , 8 , 1 )
1 / 3 ( 2 , 4 , 10 ) ( 5 , 2 , 2 ) ( 3 , 4 , 3 ) ( 9 , 5 , 4 )
1 / 3 ( 1 , 5 , 1 ) ( 4 , 3 , 3 ) ( 5 , 1 , 5 ) ( 3 , 4 , 1 )
1 ( 7 , 3 , 6 ) ( 8 , 2 , 3 ) ( 1 , 2 , 4 ) ( 3 , 7 , 2 )
Table 4. Signature vectors.
Table 4. Signature vectors.
RQZFIS 1: ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 1 , 0 , 0 ) ,
ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 0 , 1 , 0 ) .
RQZFIS 2: ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 0 , 1 , 1 ) ,
ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 0 , 1 , 0 ) .
RQZFIS 3: ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 0 , 1 , 1 ) ,
ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 1 , 0 , 1 ) .
RQZFIS 4: ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 0 , 0 , 0 ) ,
ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 0 , 0 , 0 ) .
Table 5. Shape parameters and scaling function vectors.
Table 5. Shape parameters and scaling function vectors.
σ 1 = σ 2 = σ 3 = σ 4 = ( 0.1 , 0.2 , 0.3 ) ,
η 1 = η 2 = η 3 = η 4 = ( 0.3 , 0.6 , 0.1 ) ,
α 1 = α 2 = α 3 = α 4 = ( 0.2 , 0.3 , 0.3 ) ,
σ ¯ 1 = σ ¯ 2 = σ ¯ 3 = σ ¯ 4 = ( 1 , 0.2 , 3 ) ,
η ¯ 1 = η ¯ 2 = η ¯ 3 = η ¯ 4 = ( 0.2 , 0.6 , 0.1 ) ,
α ¯ 1 = α ¯ 2 = α ¯ 3 = α ¯ 4 = ( 0.3 , 0.25 , 0.3 ) .
Table 6. Zipper IFSs parameters for Figure 5.
Table 6. Zipper IFSs parameters for Figure 5.
Figure 5aFigure 5b
σ 1 = σ 2 = σ 3 = σ 4 = ( 0.1 , 0.06 , 0.3 ) , σ 1 = σ 2 = σ 3 = σ 4 = ( 1 , 2 , 3 ) ,
η 1 = η 2 = η 3 = η 4 = ( 0.3 , 0.2 , 0.6 ) , η 1 = η 2 = η 3 = η 4 = ( 3 , 2 , 5 ) ,
ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 1 , 0 , 0 ) , ϵ 1 = ϵ 2 = ϵ 3 = ϵ 4 = ( 1 , 0 , 0 ) ,
α 1 = α 2 = α 3 = α 4 = ( 0.3 , 0.25 , 0.3 ) , α 1 = α 2 = α 3 = α 4 = ( 0.02 , 0.05 , 0.02 ) ,
σ ¯ 1 = σ ¯ 2 = σ ¯ 3 = σ ¯ 2 = ( 0.1 , 0.06 , 0.3 ) , σ ¯ 1 = σ ¯ 2 = σ ¯ 3 = σ ¯ 2 = ( 1 , 2 , 3 ) ,
η ¯ 1 = η ¯ 2 = η ¯ 3 = η ¯ 4 = ( 0.3 , 0.2 , 0.6 ) , η ¯ 1 = η ¯ 2 = η ¯ 3 = η ¯ 4 = ( 3 , 2 , 5 ) ,
ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 0 , 1 , 1 ) , ϵ ¯ 1 = ϵ ¯ 2 = ϵ ¯ 3 = ϵ ¯ 4 = ( 0 , 1 , 1 ) ,
α ¯ 1 = α ¯ 2 = α ¯ 3 = α ¯ 4 = ( 0.2 , 0.25 , 0.2 ) , α ¯ 1 = α ¯ 2 = α ¯ 3 = α ¯ 4 = ( 0.02 , 0.05 , 0.05 ) .
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Vijay; Chand, A.K.B. Convexity-Preserving Rational Cubic Zipper Fractal Interpolation Curves and Surfaces. Math. Comput. Appl. 2023, 28, 74. https://doi.org/10.3390/mca28030074

AMA Style

Vijay, Chand AKB. Convexity-Preserving Rational Cubic Zipper Fractal Interpolation Curves and Surfaces. Mathematical and Computational Applications. 2023; 28(3):74. https://doi.org/10.3390/mca28030074

Chicago/Turabian Style

Vijay, and Arya Kumar Bedabrata Chand. 2023. "Convexity-Preserving Rational Cubic Zipper Fractal Interpolation Curves and Surfaces" Mathematical and Computational Applications 28, no. 3: 74. https://doi.org/10.3390/mca28030074

Article Metrics

Back to TopTop