Tensor product q-Bernstein polynomials

An affine de Casteljau type algorithm to compute q-Bernstein Bézier curves is introduced and its intermediate points are obtained explicitly in two ways. Furthermore we define a tensor product patch, based on this algorithm, depending on two parameters. Degree elevation procedure is studied. The matrix representation of tensor product patch is given and we find the transformation matrix between a classical tensor product Bézier patch and a tensor product q-Bernstein Bézier patch. Finally, q-Bernstein polynomials B _n,m (f;x,y) for a function f(x,y), (x,y)∈[0,1]×[0,1] are defined and fundamental properties are discussed. AMS subject classification (2000)  65D17     

Degenerations of rational Bézier surface with weights in the form of exponential function

Rational Bézier surface is a widely used surface fitting tool in CAD. When all the weights of a rational Bézier surface go to infinity in the form of power function, the limit of surface is the regular control surface induced by some lifting function, which is called toric degenerations of rational Bézier surfaces. In this paper, we study on the degenerations of the rational Bézier surface with weights in the exponential function and indicate the difference of our result and the work of Garc′?a-Puente et al. Through the transformation of weights in the form of exponential function and power function, the regular control surface of rational Bézier surface with weights in the exponential function is defined, which is just the limit of the surface.Compared with the power function, the exponential function approaches infinity faster, which leads to surface with the weights in the form of exponential function degenerates faster.     

Toric Surface Patches

We define a toric surface patch associated with a convex polygon, which has vertices with integer coordinates. This rational surface patch naturally generalizes classical Bézier surfaces. Several features of toric patches are considered: affine invariance, convex hull property, boundary curves, implicit degree and singular points. The method of subdivision into tensor product surfaces is introduced. Fundamentals of a multidimensional variant of this theory are also developed.     

Curves and Surfaces Construction Based on New Basis with Exponential Functions

By incorporating two exponential functions into the cubic Bernstein basis functions, a new class of λμ-Bernstein basis functions is constructed. Based on these λμ-Bernstein basis functions, a kind of λμ-Bézier-like curve with two shape parameters, which include the cubic Bernstein-Bézier curve, is proposed. The C ¹ and C ² continuous conditions for joining two λμ-Bézier-like curves are given. By using tensor product method, a class of rectangular Bézier-like patches with four shape parameters is shown. The G ¹ and G ² continuous conditions for joining two rectangular Bézier-like patches are derived. By incorporating three exponential functions into the cubic Bernstein basis functions over triangular domain, a new class of λμη-Bernstein basis functions over triangular domain is also constructed. Based on the λμη-Bernstein basis functions, a kind of triangular λμη-Bézier-like patch with three shape parameters, which include the triangular Bernstein-Bézier cubic patch, is presented. The conditions for G ¹ continuous smooth joining two triangular λμη-Bézier-like patches are discussed. The shape parameters serve as tension parameters and have a predictable adjusting role on the curves and patches.     

点集Bézier曲线

提出了点集Bézier曲线的概念,给出了点集Bézier曲线的性质及细分算法.按照点集算术的定义,当点集是长方形闭域或圆盘时,点集Bézier曲线就是区间Bézier曲线或圆盘Bézier曲线,因此,点集Bézier曲线是对区间Bézier曲线和圆盘Bézier曲线的推广.     

Optimal constrained polynomials approximation of hyperbolas based on Lupaş q‐Bézier curves

This paper presents an explicit optimal polynomial for approximating the quadratic Lupaş q‐Bézier curve. We first prove that the quadratic Lupaş q‐Bézier curve represents a hyperbola or a parabola. Then we research the approximation of quadratic Lupaş q‐Bézier curves by polynomials. Since the denominator of quadratic Lupaş q‐Bézier curves is a linear function, the explicit optimal constrained approximation is obtained. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed method.     

A generalization of rational Bernstein–Bézier curves

This paper is concerned with a generalization of Bernstein–Bézier curves. A one parameter family of rational Bernstein–Bézier curves is introduced based on a de Casteljau type algorithm. A subdivision procedure is discussed, and matrix representation and degree elevation formulas are obtained. We also represent conic sections using rational q-Bernstein–Bézier curves. AMS subject classification (2000)  65D17     

Application of degree reduction of polynomial Bézier curves to rational case

An algorithmic approach to degree reduction of rational Bézier curves is presented. The algorithms are based on the degree reduction of polynomial Bézier curves. The method is introduced with the following steps: (a) convert the rational Bézier curve to polynomial Bézier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bézier curve, (c) determine weights of degree reduced curve, (d) convert the Bézier curve obtained through step (b) to rational Bézier curve with weights in step (c).     

Symmetric recursive algorithms for surfaces: B-patches and the de boor algorithm for polynomials over triangles

Using the concept of a symmetric recursive algorithm, we construct a new patch representation for bivariate polynomials: the B-patch. B-patches share many properties with B-spline segments: they are characterized by their control points and by a three-parameter family of knots. If the knots in each family coincide, we obtain the Bézier representation of a bivariate polynomial over a triangle. Therefore B-patches are a generalization of Bézier patches. B-patches have a de Boor-like evaluation algorithm, and, as in the case of B-spline curves, the control points of a B-patch can be expressed by simply inserting a sequence of knots into the corresponding polar form. In particular, this implies linear independence of the blending functions. B-patches can be joined smoothly and they have an algorithm for knot insertion that is completely similar to Boehm's algorithm for curves.     

The cubic trigonometric Bézier curve with two shape parameters

A cubic trigonometric Bézier curve analogous to the cubic Bézier curve, with two shape parameters, is presented in this work. The shape of the curve can be adjusted by altering the values of shape parameters while the control polygon is kept unchanged. With the shape parameters, the cubic trigonometric Bézier curves can be made close to the cubic Bézier curves or closer to the given control polygon than the cubic Bézier curves. The ellipses can be represented exactly using cubic trigonometric Bézier curves.     

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 the classification of rational second-order Bézier curves

Each rational (projective) Bézier curve is determined by three points in the plane and by positive weights assigned to these points. As is known, any such curve is an arc of either a parabola, an ellipse, or a hyperbola. An equation for a projective Bézier curve in barycentric coordinates is derived. This equation depends on a parameter. A complete classification of the curves under consideration in terms of parameter values is suggested.     

两条连续的有理Bézier曲线的逼近合并

目前多项式 Bézier曲线的逼近合并问题已研究得比较深入 ,而有理 Bézier情形主要还是通过两类多项式 h和 H来降阶逼近 ,但是在工业制造中有重要意义的有理 Bézier曲线的合并问题一直缺乏研究 .本文通过控制点的优化扰动将两连续的满足权约束条件的有理 Bézier曲线转化成新的两有理Bézier曲线 ,使它们符合精确合并条件 ;并将合并得到的同阶有理 Bézier曲线看成是原两曲线的有理逼近     

一类参数曲线正则性的判别

Bézier曲线的正则性,完全由它的控制顶点决定.理想的情况是由Bézier曲线的控制顶点的几何关系,就可以判断它的正则性.本文由Bézier曲线的导矢曲线在[0,1]不等于零这些代数条件,推导出了与之等价的Bézier曲线的控制顶点之间的几何关系,即只需知道顶点之间的相对位置或计算相邻线段的斜率就可快速判断Bézier曲线的正则性.最后给出了数值例子.     

Linear precision for parametric patches

We give a precise mathematical formulation for the notions of a parametric patch and linear precision, and establish their elementary properties. We relate linear precision to the geometry of a particular linear projection, giving necessary (and quite restrictive) conditions for a patch to possess linear precision. A main focus is on linear precision for Krasauskas’ toric patches, which we show is equivalent to a certain rational map on \mathbb C\mathbb P^d{\mathbb C}{\mathbb P}^d being a birational isomorphism. Lastly, we establish the connection between linear precision for toric surface patches and maximum likelihood degree for discrete exponential families in algebraic statistics, and show how iterative proportional fitting may be used to compute toric patches.     

High-order adaptive method for computing two-dimensional invariant manifolds of three-dimensional maps

An efficient and accurate numerical method is presented for computing invariant manifolds of maps which arise in the study of dynamical systems. A quasi-interpolation method due to Hering-Bertram et al. is used to decrease the number of points needed to compute a portion of the manifold. Bézier triangular patches are used in this construction, together with adaptivity conditions based on properties of these patches. Several numerical tests are performed, which show the method to compare favorably with previous approaches.     

Bézier form of dual bivariate Bernstein polynomials

Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining Bézier form of the L ₂-solution of the problem of best polynomial approximation of Bézier curve or surface. In this connection, the Bézier coefficients of dual Bernstein polynomials are to be evaluated at a reasonable cost. In this paper, a set of recurrence relations satisfied by the Bézier coefficients of dual bivariate Bernstein polynomials is derived and an efficient algorithm for evaluation of these coefficients is proposed. Applications of this result to some approximation problems of Computer Aided Geometric Design (CAGD) are discussed.     

Degree elevation of nurbs curves by weighted blossom

An algorithmic approach to degree elevation of NURBS curves is presented. The new algorithms are based on the weighted blossoming process and its matrix representation. The elevation method is introduced that consists of the following steps: (a) decompose the NURBS curve into piecewise rational Bézier curves, (b) elevate the degree of each rational Bézier piece, and (c) compose the piecewise rational Bézier curves into NURBS curve.     

<Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript> positivity preserving scattered data interpolation using rational Bernstein-Bézier triangular patch

A local C ¹ positivity preserving scheme is developed using Bernstein-Bézier rational cubic function. The domain is triangulated by Delaunay triangulation method. Simple sufficient conditions are derived on the inner and boundary Bézier ordinates to preserve the shape of positive data. These inner and boundary Bézier ordinates involve weights in their definition. In any triangular patch if the Bézier ordinates do not satisfy the derived conditions of positivity, then these are modified by the weights (free parameters) involved in the construction of Bernstein-Bézier rational cubic function to preserve the shape of positive scattered data.