Polynomial approximation of rational Bézier curves with constraints

We present an efficient method to solve the problem of the constrained least squares approximation of the rational Bézier curve by the polynomial Bézier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials, and exploits their recursive properties. Examples are given, showing the effectiveness of the algorithm.     

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.     

Judging or setting weight steady-state of rational Bézier curves and surfaces

Many works have investigated the problem of reparameterizing rational Bézier curves or surfaces via Mbius transformation to adjust their parametric distribution as well as weights, such that the maximal ratio of weights becomes smallerthat some algebraic and computational properties of the curves or surfaces can be improved in a way. However, it is an indication of veracity and optimization of the reparameterization to do prior to judge whether the maximal ratio of weights reaches minimum, and verify the new weights after Mbius transformation. What's more the users of computer aided design softwares may require some guidelines for designing rational Bézier curves or surfaces with the smallest ratio of weights. In this paper we present the necessary and sufficient conditions that the maximal ratio of weights of the curves or surfaces reaches minimum and also describe it by using weights succinctly and straightway.The weights being satisfied these conditions are called being in the stable state. Applying such conditions, any giving rational Bézier curve or surface can automatically be adjusted to come into the stable state by CAD system, that is, the curve or surface possesses its optimal parametric distribution. Finally, we give some numerical examples for demonstrating our results in important applications of judging the stable state of weights of the curves or surfaces and designing rational Bézier surfaces with compact derivative bounds.     

Degree elevation from Bzier curve to C-Bzier curve with corner cutting form

The existing results of curve degree elevation mainly focus on the degree of algebraic polynomials. The paper considers the elevation of degree of the trigonometric polynomial, from a Bzier curve on the algebraic polynomial space, to a C-B′ezier curve on the algebraic and trigonometric polynomial space. The matrix of degree elevation is obtained by an operator presentation and a derivation pyramid. It possesses not a recursive presentation but a direct expression. The degree elevation process can also be represented as a corner cutting form.     

有理Bézier函数

本文研究了有理Bézier函数与有理Bézier曲线的关系,提出了诱导控制多边形的概念,籍助于它从几何观点出发,研究了有理函数Bézier的一些性质。     

Bézier曲面拟合

A method of fitting data points with piecewise least square is provided for thecomputer aided geometric design. It contains fitting of Bezier curves, fitting ofBezier surfaces and constrained fitting of surfaces. This method has been put into usein the design system for automobile surfaces.     

The Intersection of a Triangular Bézier Patch and a Plane

In this paper, the problem of finding the intersection of a triangular Bézier patch and a plane is studied. For the degree that one frequently encounters in practice, i.e. $n=2,3$, an efficient and reliable algorithm is obtained, and computational steps are presented.     

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.     

点集Bézier曲线

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

三角Bézier曲面和四边Bézier曲面之间的相互转化

Bézier曲面有两种不同的形式：三角Bézier曲面和四边Bézier曲面,它们有着不同的基底和不同的几何拓扑结构,但是它们也有很多共同的性质,因此三角Bézier曲面和四边Bézier曲面之间的相互转化就成为CAGD里一个重要研究课题．在本文中,我们用函数复合的方法实现两者之间的相互转化．被复合的两个函数,一个用Polar形式表示,另一个用常见的Bernstein基形式表示．     

Bounding Pyramids and Bounding Cones for Triangular Bézier Surfaces

This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bézier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction, we provide a way to compute hodographs of triangular Bézier surfaces and improve the algorithm for computing the bounding cone of a set of vectors.     

区间Bézier曲线的边界

本文证明了ｎ次区间Ｂéｚｉｅｒ曲线的边界必由分段ｎ次Ｂéｚｉｅｒ曲线与平行于坐标轴的直线段构成，并具体给出了２次和３次区间Ｂéｚｉｅｒ曲线的边界表示．     

Verifying the Implicitization Formulae for Degree N Rational Bézier Curves

This is a continuation of short communication$^{[1]}$. In [1] a verification of the implicitization equation for degree two rational Bézier curves is presented which does not require the use of resultants. This paper presents these verifications in the general cases, i.e., for degree $n$ rational Bézier curves. Thus some interesting interplay between the structure of the $n×n$ implicitization matrix and the de Casteljau algorithm is revealed.     

指数平均Bézier曲线族

利用指数平均族与Béier曲线结合定义了指数平均Bézier曲线族.首先研究了指数平均族,阐述了指数平均族的单调性和正规性,其次由Bernstein函数定义得到n次s阶指数平均Bernstein函数,讨论了它与函数f之间的关系,最后,研究指数平均Bézier曲线族的性质,讨论了它的升阶,de casteljan算法,分割定理等.     

Bézier variant of Baskakov-Beta-Stancu operators

In the year 1994, Gupta (Approx Theory Appl (N.S.) 10(3):74–78, 1994) introduced the integral modification of well known Baskakov operators with weights of Beta basis functions and obtained better approximation over the usual Baskakov Durrmeyer operators. The rate of convergence for Bézier variant of these operators for functions of bounded variations were discussed in Gupta (Int J Math Math Sci 32(8):471–479, 2002). The present paper is the extension of the previous work, here we consider the Bézier variant of Baskakov-Beta-Stancu operators. We estimate the rate of convergence of these operators for the bounded functions. In the end of the paper we suggest an open problem.     

On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis

An efficient evaluation algorithm for rational triangular Bernstein–Bézier surfaces with any number of barycentric coordinates is presented and analyzed. In the case of three barycentric coordinates, it coincides with the usual rational triangular de Casteljau algorithm. We perform its error analysis and prove the optimal stability of the basis. Comparisons with other evaluation algorithms are included, showing the better stability properties of the analyzed algorithm.     

Approximation of a planar cubic Bézier spiral by circular arcs

A planar cubic Bézier curve that is a spiral, i.e., its curvature varies monotonically, does not have internal cusps, loops, and inflection points. It is suitable as a design tool for applications in which fair curves are important. Since it is polynomial, it can be conveniently incorporated in CAD systems that are based on B-splines, Bézier curves, or NURBS. When machining objects, it is desirable that as much as possible of a curved toolpath be approximated by a sequence of circular arcs rather than straight-line segments. Such an arc-spline approximation of a planar cubic Bézier spiral is presented.     

G2 composite cubic Bézier curves

We present an algorithm for creating planar G² spline curves using rational Bézier cubic segments. The splines interpolate a sequence of points, tangents and curvatures. In addition each segment has two more geometric shape handles. These are obtained from an analysis of the singular point of the curve. The individual segments are convex, but zero curvature can be assigned at a junction point, hence inflection points can be placed where desired but cannot occur otherwise.     

有理Bézier曲线hybrid逼近收敛性

hybrid逼近算法是一种用多项式逼近有理多项式的有效方法,但是这种算法逼近有时会发散.这样讨论它的收敛性条件就变得弥足重要.在前人工作的基础上研究了重新参数化对有理Bézier曲线hybrid逼近收敛性的影响,在权系数的某些假定下,得到了重新参数化后hybrid逼近收敛的充分条件.     

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.