Rate of convergence in simultaneous approximation for Szász-Mirakyan-Durrmeyer operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Szász-Mirakyan-Durrmeyer operators by using the decomposition technique of functions of bounded variation.     

Simultaneous approximation for the Bézier variant of Baskakov-Beta operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.     

Degree of approximation to function of bounded variation by Bézier variant of MKZ operators

Guo (Approx. Theory Appl. 4 (1988) 9-18) introduced the integral modification of Meyer-Konig and Zeller operators and studied the rate of convergence for functions of bounded variation. In this paper we introduce the Bézier variant of these integrated MKZ operators and study the rate of convergence by means of the decomposition technique of functions of bounded variation together with some results of probability theory and the exact bound of MKZ basis functions. Recently, Zeng (J. Math. Anal. Appl. 219 (1998) 364-376) claimed to improve the results of Guo and Gupta (Approx. Theory Appl. 11 (1995) 106-107), but there is a major mistake in the paper of Zeng. For special case our main theorem gives the correct estimate on the rate of convergence, over the result of Zeng.     

On the rates of convergence of BBH-Kantorovich operators and their Bézier variant

In the present paper we consider the Bézier variant of BBH-Kantorovich operators J_n,αf for functions f measurable and locally bounded on the interval [0, ∞) with α ? 1. By using the Chanturiya modulus of variation we estimate the rate of pointwise convergence of J_n,αf(x) at those x > 0 at which the one-sided limits f(x+), f(x−) exist. The very recent result of Chen and Zeng (2009) [L. Chen, X.M. Zeng, Rate of convergence of a new type Kantorovich variant of Bleimann-Butzer-Hahn Operators, J. Inequal. Appl. 2009 (2009) 10. Article ID 852897] is extended to more general classes of functions.     

Pointwise approximation by Bézier variant of integrated MKZ operators

In this paper the pointwise approximation of Bézier variant of integrated MKZ operators for general bounded functions is studied. Two estimate formulas of this type approximation are obtained. The approximation of functions of bounded variation becomes a special case of the main result of this paper. In the case of functions of bounded variation, Theorem B of the paper corrects the mistake of Theorem 1 of the article [V. Gupta, Degree of approximation to functions of bounded variation by Bézier variant of MKZ operators, J. Math. Anal. Appl. 289 (2004) 292-300].     

An estimate on the convergence of Baskakov-Bézier operators

In the present paper we estimate the rate of convergence on functions of bounded variation for the Bézier variant of the Baskakov operators Bn,α(f,x). Here we have studied the rate of convergence of Bn,α(f,x) for the case 0<α<1.     

Rate of approximation for the Bézier variant of Balazs Kantorovich operators

In the present paper we study the Bézier variant of the well known Balazs-Kantorovich operators L _n,α (f,x), α ≥ 1. We establish the rate of convergence for functions of bounded variation. For particular value α = 1, our main theorem completes a result due to Agratini [Math. Notes (Miskolc) 2 (2001), 3–10]. Communicated by Michal Zajac     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

Circle approximation using LN Bézier curves of even degree and its application

We present an approximation method of circular arcs using linear-normal (LN) Bézier curves of even degree, four and higher. Our method achieves G^m$G^m$ continuity for endpoint interpolation of a circular arc by a LN Bézier curve of degree 2m  , for m=2,3$m=2,3$. We also present the exact Hausdorff distance between the circular arc and the approximating LN Bézier curve. We show that the LN curve has an approximation order of 2m+2$2m+2$, for m=2,3$m=2,3$. Our approximation method can be applied to offset approximation, so obtaining a rational Bézier curve as an offset approximant. We derive an algorithm for offset approximation based on the LN circle approximation and illustrate our method with some numerical examples.     

A planar cubic Bézier spiral

A planar cubic Bézier curve segment that is a spiral, i.e., its curvature varies monotonically with arc-length, is discussed. Since this curve segment does not have cusps, loops, and inflection points (except for a single inflection point at its beginning), it is suitable for applications such as highway design, in which the clothoid has been traditionally used. Since it is polynomial, it can be conveniently incorporated in CAD systems that are based on B-splines, Bézier curves, or NURBS (nonuniform rational B-splines) and is thus suitable for general curve design applications in which fair curves are important.     

Approximate Bézier curves by cubic LN curves

In order to derive the offset curves by using cubic Bézier curves with a linear field of normal vectors (the so-called LN Bézier curves) more efficiently, three methods for approximating degree n Bézier curves by cubic LN Bézier curves are considered, which includes two traditional methods and one new method based on Hausdorff distance. The approximation based on shifting control points is equivalent to solving a quadratic equation, and the approximation based on L₂ norm is equivalent to solving a quartic equation. In addition, the sufficient and necessary condition of optimal approximation based on Hausdorff distance is presented, accordingly the algorithm for approximating the degree n Bézier curves based on Hausdorff distance is derived. Numerical examples show that the error of approximation based on Hausdorff distance is much smaller than that of approximation based on shifting control points and L₂ norm, furthermore, the algorithm based on Hausdorff distance is much simple and convenient.     

On the conditions for the coincidence of two cubic Bézier curves

In a recent article, Wang et al. [2] derive a necessary and sufficient condition for the coincidence of two cubic Bézier curves with non-collinear control points. The condition reads that their control points must be either coincident or in reverse order. We point out that this uniqueness of the control points for polynomial cubics is a straightforward consequence of a previous and more general result of Barry and Patterson, namely the uniqueness of the control points for rational Bézier curves. Moreover, this uniqueness applies to properly parameterized polynomial curves of arbitrary degree.     

Triangular Bézier sub-surfaces on a triangular Bézier surface

This paper considers the problem of computing the Bézier representation for a triangular sub-patch on a triangular Bézier surface. The triangular sub-patch is defined as a composition of the triangular surface and a domain surface that is also a triangular Bézier patch. Based on de Casteljau recursions and shifting operators, previous methods express the control points of the triangular sub-patch as linear combinations of the construction points that are constructed from the control points of the triangular Bézier surface. The construction points contain too many redundancies. This paper derives a simple explicit formula that computes the composite triangular sub-patch in terms of the blossoming points that correspond to distinct construction points and then an efficient algorithm is presented to calculate the control points of the sub-patch.     

Conditions for coincidence of two cubic Bézier curves

This paper presents a necessary and sufficient condition for judging whether two cubic Bézier curves are coincident: two cubic Bézier curves whose control points are not collinear are coincident if and only if their corresponding control points are coincident or one curve is the reversal of the other curve. However, this is not true for degree higher than 3. This paper provides a set of counterexamples of degree 4.     

An extension of the Bézier model

In this paper, we first construct a new kind of basis functions by a recursive approach. Based on these basis functions, we define the Bézier-like curve and rectangular Bézier-like surface. Then we extend the new basis functions to the triangular domain, and define the Bernstein-Bézier-like surface over the triangular domain. The new curve and surfaces have most properties of the corresponding classical Bézier curve and surfaces. Moreover, the shape parameter can adjust the shape of the new curve and surfaces without changing the control points. Along with the increase of the shape parameter, the new curve and surfaces approach the control polygon or control net. In addition, the evaluation algorithm for the new curve and triangular surface are provided.     

Computing the minimum distance between two Bézier curves

A sweeping sphere clipping method is presented for computing the minimum distance between two Bézier curves. The sweeping sphere is constructed by rolling a sphere with its center point along a curve. The initial radius of the sweeping sphere can be set as the minimum distance between an end point and the other curve. The nearest point on a curve must be contained in the sweeping sphere along the other curve, and all of the parts outside the sweeping sphere can be eliminated. A simple sufficient condition when the nearest point is one of the two end points of a curve is provided, which turns the curve/curve case into a point/curve case and leads to higher efficiency. Examples are shown to illustrate efficiency and robustness of the new method.     

Improved bounds on the magnitude of the derivative of rational Bézier curves

In this paper we derive some new derivative bounds of rational Bézier curves according to some existing identities and inequalities. The comparison of the new bounds with some existing ones is also presented.     

Bézier representation of the constrained dual Bernstein polynomials

Explicit formulae for the Bézier coefficients of the constrained dual Bernstein basis polynomials are derived in terms of the Hahn orthogonal polynomials. Using difference properties of the latter polynomials, efficient recursive scheme is obtained to compute these coefficients. Applications of this result to some problems of CAGD is discussed.     

Approximating conic sections by constrained Bézier curves of arbitrary degree

In this paper, an algorithm for approximating conic sections by constrained Bézier curves of arbitrary degree is proposed. First, using the eigenvalues of recurrence equations and the method of undetermined coefficients, some exact integral formulas for the product of two Bernstein basis functions and the denominator of rational quadratic form expressing conic section are given. Then, using the least squares method, a matrix-based representation of the control points of the optimal Bézier approximation curve is deduced. This algorithm yields an explicit, arbitrary-degree Bézier approximation of conic sections which has function value and derivatives at the endpoints that match the function value and the derivatives of the conic section up to second order and is optimal in the _L2$L_2$ norm. To reduce error, the method can be combined with a curve subdivision scheme. Computational examples are presented to validate the feasibility and effectiveness of the algorithm for a whole curve or its part generated by a subdivision.