Dual bases for Wang-Bézier basis and their applications

This paper presents the dual bases for Wang-Bézier curves with a position parameter L, which include Bézier curve, Wang-Ball curve and some intermediate curves. The Marsden identity and the transformation formulas from Bézier curve to Wang-Bézier curve are also given. These results are useful for the application of Wang-Bézier curve and their popularization in Computer Aided Geometric Design.     

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.     

Dual Bases for a New Family of Generalized Ball Bases

This paper presents the dual bases for a new family of generalized Ball curves with a position parameter K, which includes the Bezier curve, generalized Said-Ball curve and some intermediate curves. Using the dual bases, the relative Marsden identity, conversion formulas of bases and control points of various curves are obtained.     

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.     

The weighted dual functions for Wang-Bézier type generalized Ball bases and their applications

By introducing the inner-product matrix of two vector functions and using conversion matrix, explicit formulas for the dual basis functions of Wang-Bézier type generalized Ball bases (WBGB) with respect to the Jacobi weight function are given. The dual basis functions with and without boundary constraints are also considered. As a result, the paper includes the weighted dual basis functions of Bernstein basis, Wang-Ball basis and some intermediate bases. Dual functionals for WBGB and the least square approximation polynomials are also obtained.     

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.     

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.     

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.     

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.     

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.     

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.     

Accurate evaluation algorithm for bivariate polynomial in Bernstein–Bézier form

In this paper it is presented a compensated de Casteljau algorithm to accurately evaluate a bivariate polynomial in Bernstein–Bézier form. The principle is to apply error-free transformations to improve the traditional de Casteljau algorithm. A forward error and a running error analysis are performed. Finally, some numerical experiments illustrate the accuracy of the proposed algorithm in ill-conditioned problems.     

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.     

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.     

Sharp Békollé estimates for the Bergman projection

We prove sharp estimates for the Bergman projection in weighted Bergman spaces in terms of the Békollé constant. Our main tools are a dyadic model dominating the operator and an adaptation of a method of Cruz-Uribe, Martell and Pérez.     

A third order partial differential equation for isotropic boundary based triangular Bézier surface generation

We approach surface design by solving a linear third order Partial Differential Equation (PDE). We present an explicit polynomial solution method for triangular Bézier PDE surface generation characterized by a boundary configuration. The third order PDE comes from a symmetric operator defined here to overcome the anisotropy drawback of any operator over triangular Bézier surfaces.     

On G continuous interpolatory composite quadratic Bézier curves

In the paper the interpolation by G² continuous composite quadratic Bézier curves is studied. It is shown that the interpolation problem can be naturally posed correctly in such a way that a smooth curve f is approximated up to the order 4, i.e., one order more than in the corresponding function case. In addition, the tangent direction of f is approximated up to order 3, and the curvature up to order 2.     

A note on iterative process for G-multi degree reduction of Bézier curves

In the paper [A. Rababah, S. Mann, Iterative process for G²-multi degree reduction of Bézier curves, Applied Mathematics and Computation 217 (2011) 8126-8133], Rababah and Mann proposed an iterative method for multi-degree reduction of Bézier curves with C¹ and G²-continuity at the endpoints. In this paper, we provide a theoretical proof for the existence of the unique solution in the first step of the iterative process, while the proof in their paper applies only in some special cases. Also, we give a complete convergence proof for the iterative method. We solve the problem by using convex quadratic optimization.     

Sample-based polynomial approximation of rational Bézier curves

We present an iteration method for the polynomial approximation of rational Bézier curves. Starting with an initial Bézier curve, we adjust its control points gradually by the scheme of weighted progressive iteration approximations. The L_p-error calculated by the trapezoidal rule using sampled points is used to guide the iteration approximation. We reduce the L_p-error by a predefined factor at every iteration so as to obtain the best approximation with a minimum error. Numerical examples demonstrate the fast convergence of our method and indicate that results obtained using the L₁-error criterion are better than those obtained using the L₂-error and L_∞-error criteria.     

Recursive polynomial curve schemes and computer-aided geometric design

A class of polynomial curve schemes is introduced that may have widespread application to CAGD (computer-aided geometric design), and which contains many well-known curve schemes, including Bézier curves, Lagrange polynomials, B-spline curve (segments), and Catmull-Rom spline (segments). The curves in this class can be characterized by a simple recursion formula. They are also shown to have many properties desirable for CAGD; in particular they are affine invariant, have the convex hull property, and possess a recursive evaluation algorithm. Further, these curves have shape parameters which may be used as a design tool for introducing such geometric effects as tautness, bias, or interpolation. The link between probability theory and this class of curves is also discussed.Communicated by Klaus Höllig.