Lupaş blending functions with shifted knots and q-Bézier curves

In this paper, we introduce blending functions of Lupaş q-Bernstein operators with shifted knots for constructing q-Bézier curves and surfaces. We study the nature of degree elevation and degree reduction for Lupaş q-Bézier Bernstein functions with shifted knots for t∈[a[μ]q+b,[μ]q+a[μ]q+b]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$t \in [\frac{a}{[\mu ]_{q}+b} , \frac{[\mu ]_{q}+a}{[\mu ]_{q}+b} ]$\end{document}. For the parameters a=b=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a=b=0$\end{document}, we get Lupaş q-Bézier curves defined on [0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$[0,1]$\end{document}. We show that Lupaş q-Bernstein functions with shifted knots are tangent to fore-and-aft of its polygon at end points. We present a de Casteljau algorithm to compute Bernstein Bézier curves and surfaces with shifted knots. The new curves have some properties similar to q-Bézier curves. Similarly, we discuss the properties of the tensor product for Lupaş q-Bézier surfaces with shifted knots over the rectangular domain.


Introduction
Approximation theory basically deals with approximation of functions by simpler functions. Broadly, it is divided into theoretical and constructive approximations. Recently, in the field of constructive approximation, Mursaleen et al. [27] introduced Lupaş q-Bernstein operators with shifted knots using q-calculus as follows.
Let a, b ∈ N 0 (the set of all nonnegative integers), where 0 ≤ a ≤ b. Then for q ∈ (0, 1) and any f ∈ C[0, 1], the Lupaş q-Bernstein operators with shifted knots are defined by or The other forms of these operators are as follows: or We can easily verify that all four forms are equivalent. Here a [μ] q +b ≤ u ≤ [μ] q +a [μ] q +b for 0 ≤ a ≤ b. In the case a = b = 0 the above operators reduce to the Lupaş q-Bernstein operators [23]. Further for a = b = 0 and q = 1, they reduce to the classical Bernstein operators [4].
Computer aided geometric design is a discipline that deals with study of computational aspects of geometric objects. Bases of Bernstein operators and its generalizations are used in computer aided geometric design to construct curves and surfaces. For more concepts and techniques used in CAGD, we refer to [2, 3, 9-12, 14, 15, 17, 39]. The most popular Bézier curves are constructed with the help of Bernstein bases [5].
Recently, Khalid et al. [20] studied Bézier curves and surfaces constructed with modified Bernstein bases of classical Bernstein operators with shifted knots.
Motivated by [20,27], we study various properties of Lupaş q-Bernstein basis functions or blending functions with shifted knots [27]. Popular programs, like Adobe's illustrator and flash, and font imaging systems such as postcript utilize Bernstein polynomials to form Bézier curves. The novelty of this paper is that we can generate blending functions on [0, 1] and its subintervals and the parameters q, a, and b provide flexibility in construction of blending functions and Bézier curves and surfaces. The algorithms and other derived results using blending functions with shifted knots will be very useful in implementation using computers for simulation purposes.
Let us recall some basic definitions and notations of quantum calculus [16]. For any fixed real number q > 0, the q-integer [s] q for s ∈ N and q-factorial [s] q ! are defined as The q-analogue of binomial expansion is From the above we have Also, from the q-analogue of binomial expansion we have From q-binomial expansion we can also derive: In fact, When (-ν) is a negative integer, then The q-analogues of binomial coefficients are defined by A further extension of q-calculus is (p, q)-calculus. For details about (p, q)-calculus and its applications in approximation theory, we refer to [18,25,26].

Lupaş q-Bernstein functions with shifted knots
The Lupaş basis (blending) functions with shifted knots obtained from (2) are as follows:

Degree elevation and reduction for Lupaş q-Bernstein functions with shifted knots
This algorithm has been used to change the bases of Bézier curves. We can elevate the degree of curve to obtain more local control in designing the curve. With the help of this algorithm, we can construct a new control polygon by taking a convex combination of the old control points that retains the previous points. For this application, identities (12) and (13) and Theorem 3.1 are useful.

Identities
and Similarly, from (3) we can also obtain its other forms: Similarly, from we have

Theorem 3.1 Each Lupaş q-Bernstein function with shifted knots of degree μ is a linear
combination of two Lupaş q-Bernstein functions with shifted knots of degree μ + 1: where a [μ] q +b ≤ t ≤ [μ] q +a [μ] q +b for nonnegative integers a, b satisfying 0 ≤ a ≤ b.
Proof We obtain this result by adding identities (12) and (13).

Theorem 3.2 Each Lupaş q-Bernstein function with shifted knots of degree μ is a linear combination of two Lupaş q-Bernstein functions with shifted knots of degree μ -1:
Proof Using a Pascal-type relation, we have

Lupaş q-Bernstein Bézier curves with shifted knots
The Lupaş q-Bernstein Bézier curves with shifted knots of degree μ can be represented in the form of linear combination of control points and Lupaş q-Bernstein functions with shifted knots: where P s are the control points. After joining these points, we get a polygon called a control polygon.Now after defining the properties of Lupaş q-Bernstein functions with shifted knots, we examine the properties of the above curves.

Theorem 4.1 Property of derivative at the end points:
that is, Lupaş q-Bernstein curves with shifted knots are tangential at the end points of its control polygon. Proof

P(t) = V(t).
Taking the derivatives of both sides with respect to t, we have Then After some calculation, we get Similarly, we have which completes the proof.

Degree elevation for Lupaş q-Bernstein Bézier curves with shifted knots
Lupaş q-Bernstein Bézier curves with shifted knots have a degree elevation formula, which is the same as that for the classical Bézier curves. With the help of this technique, we can attain more control over the shape of a given curve: after using degree elevation where This statement can be obtained from Theorem 3.1. If we put a = b = 0 and q = 1, then formula (21) changes to the Bézier curves degree elevation formula. Denoting by P = (P 0 , P 1 , . . . , P μ ) T the vector of control points of the initial Bézier curve of degree μ and by P (1) = (P * 0 , P * 1 , . . . , P * μ+1 ) the vector of control points of the degree elevated Bézier curve of degree μ + 1, we can define the degree elevation procedure as where T μ+1 is given by when h = s, s + 1.
After degree elevation, the vector of new control points of Bézier curves of degree μ + l is P (l) = T μ+l T μ+2 · · · T μ+1 P for l ∈ N.
As l − → ∞, the control polygon P (l) converges to the Bézier curve.
In next section, we study a de Casteljau-type algorithm. The de Casteljau algorithm is an elementary technique of shape designs. This algorithm can be used to split a single curve into two curves at an arbitrary parameter value.

De Casteljau algorithm
Bźier curves with shifted knots of degree μ can be represented in the form of a linear combination of two Bézier curves with shifted knots of degree μ -1, and we can obtain two algorithms to assess Bézier curves with shifted knots. Then It is clear that the results can be obtained from Theorem 3.2. Let P 0 = (P 0 , P 1 , . . . , P μ ) T and P r = (P r 0 , P r 1 , . . . , P r μ-r ) T . Then the algorithm of de Casteljau type can be expressed as follows.

Tensor product of Lupaş q-Bernstein Bézier surfaces with shifted knots on
where P i,j ∈ R 3 (i = 0, 1, . . . , ν, s = 0, 1, . . . , μ), and B i,a,b ν,q (u) and B j,a,b μ,q (v) are Lupaş and Bernstein functions, respectively. Here P i,j denotes the control points. By joining adjacent points of same rows/columns we can get a control net of the tensor product Bézier surface.

Affine invariance property: Since
P(u, v) denotes is combination of its control points. 2. Convex hull property: Convex combination of P i,j is denoted by P(u, v) and lies in the convex hull of its control net. 3. Isoparametric property for curves: The isoparametric curves v = v * and u = u * of a tensor product Bézier surface are respectively the Lupaş Bézier curves with shifted knots of degrees ν and μ, namely, The boundaries of the curves of P(u, v) are evaluated by P(u, a [μ] q +b ), P(u, [μ] q +b , v). 4. Interpolation property at corner points: The corner control net coincides with the four corners of the surface: 5. Reducibility: When a = b = 0 and q = 1, formula (25) reduces to the classical tensor product Bézier patch.

Degree elevation and de Casteljau algorithm
A tensor product Lupaş q-Bernstein surface with shifted knots of degree ν × μ is P(u, v).