Construction of Normalized B-Splines for a Family of Smooth Spline Spaces Over Powell–Sabin Triangulations

We construct a suitable B-spline representation for a family of bivariate spline functions with smoothness r≥1 and polynomial degree 3r?1. They are defined on a triangulation with Powell–Sabin refinement. The basis functions have a local support, they are nonnegative, and they form a partition of unity. The construction involves the determination of triangles that must contain a specific set of points. We further consider a number of CAGD applications. We show how to define control points and control polynomials (of degree 2r?1), and we provide an efficient and stable computation of the Bernstein–Bézier form of such splines.     

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

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

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     

Products of B-patches

Products and tensor products of multivariate polynomials in B-patch form are viewed as linear combinations of higher degree B-patches. Univariate B-spline segments and certain regions of simplex splines are examples of B-patches. A recursive scheme for transforming tensor product B-patch representations into B-patch representations of more variables is presented. The scheme can also be applied for transforming ann-fold product of B-patch expansions into a B-patch expansion of higher degree. Degree raising formulas are obtained as special cases. The scheme calculates the blossom of the (tensor) product surface and generalizes the pyramidal recursive scheme for B-patches.     

Constrained multi-degree reduction of triangular Bézier surfaces

This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms for multi-degree reduction of triangular Bezier surfaces with constraints, providing explicit degree-reduced surfaces. The first algorithm can obtain the explicit representation of the optimal degree-reduced surfaces and the approximating error in both boundary curve constraints and corner constraints. But it has to solve the inversion of a matrix whose degree is related with the original surface. The second algorithm entails no matrix inversion to bring about computational instability, gives stable degree-reduced surfaces quickly, and presents the error bound. In the end, the paper proves the efficiency of the two algorithms through examples and error analysis.     

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.     

Rational cubic/quartic Said-Ball conics

In CAGD, the Said-Ball representation for a polynomial curve has two advantages over the Bézier representation, since the degrees of Said-Ball basis are distributed in a step type. One advantage is that the recursive algorithm of Said-Ball curve for evaluating a polynomial curve runs twice as fast as the de Casteljau algorithm of Bézier curve. Another is that the operations of degree elevation and reduction for a polynomial curve in Said-Ball form are simpler and faster than in Bézier form. However, Said-Ball curve can not exactly represent conics which are usually used in aircraft and machine element design. To further extend the utilization of Said-Ball curve, this paper deduces the representation theory of rational cubic and quartic Said-Ball conics, according to the necessary and sufficient conditions for conic representation in rational low degree Bézier form and the transformation formula from Bernstein basis to Said-Ball basis. The results include the judging method for whether a rational quartic Said-Ball curve is a conic section and design method for presenting a given conic section in rational quartic Said-Ball form. Many experimental curves are given for confirming that our approaches are correct and effective.     

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.     

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.     

Computing ECT-B-splines recursively

ECT-spline curves for sequences of multiple knots are generated from different local ECT-systems via connection matrices. Under appropriate assumptions there is a basis of the space of ECT-splines consisting of functions having minimal compact supports, normalized to form a nonnegative partition of unity. The basic functions can be defined by generalized divided differences [24]. This definition reduces to the classical one in case of a Schoenberg space. Under suitable assumptions it leads to a recursive method for computing the ECT-B-splines that reduces to the de Boor–Mansion–Cox recursion in case of ordinary polynomial splines and to Lyche's recursion in case of Tchebycheff splines. For sequences of simple knots and connection matrices that are nonsingular, lower triangular and totally positive the spline weights are identified as Neville–Aitken weights of certain generalized interpolation problems. For multiple knots they are limits of Neville–Aitken weights. In many cases the spline weights can be computed easily by recurrence. Our approach covers the case of Bézier-ECT-splines as well. They are defined by different local ECT-systems on knot intervals of a finite partition of a compact interval [a,b] connected at inner knots all of multiplicities zero by full connection matrices A ^[i] that are nonsingular, lower triangular and totally positive. In case of ordinary polynomials of order n they reduce to the classical Bézier polynomials. We also present a recursive algorithm of de Boor type computing ECT-spline curves pointwise. Examples of polynomial and rational B-splines constructed from given knot sequences and given connection matrices are added. For some of them we give explicit formulas of the spline weights, for others we display the B-splines or the B-spline curves. *Supported in part by INTAS 03-51-6637.     

Approximation of a Continuous Curve by its Bernstein-B��zier Operator

In this paper we consider integer and rational parametric Bézier curves and study the distance between the curve and its control polygon. To measure the distance we use first and second order moduli of smoothness of vector-valued function. We consider also NURBS curves with equidistant knots. Some direct approximation theorems will be presented.     

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.     

The fairing and G1 continuity of quartic C‐Bézier curves

Quartic C‐Bézier curves possess similar properties with the traditional Bézier curves including terminal property, convex hull property, affine invariance, and approaching the shape of their control polygons as the shape parameter α decreases. In this paper, by adjusting the shape parameter α on the basis of the utilization of the least square approximation and nonlinear functional minimization together with fairing of a quartic C‐Bézier curve with G¹ continuity of quartic C‐Bézier curve segments, we develop a fairing and G¹ continuity algorithm for any given stitching coefficients λ_k(k = 1,2,…,n ? 1). The shape parameters α_i(i=1, 2, …, n) can be adjusted by the value of control points. The curvature of the resulting quartic C‐Bézier curve segments after fairing is more uniform than before. Moreover, six examples are provided in the paper to demonstrate the efficacy of the algorithm and illustrate how to apply this algorithm to the computer‐aided design/computer‐aided manufacturing modeling systems. Copyright © 2015 John Wiley & Sons, Ltd.     

The mixed directional difference–summation algorithm for generating the Bézier net of a trivariate four-direction Box-spline

Trivariate Box-splines lack an efficient and general exact evaluation technique. This paper presents one possible and underexploited approach to solving this problem. The algorithm we propose is based on mixed directional differences and summations for computing the Bézier net coefficients of all trivariate four-direction Box-splines of any degree over tetrahedral tessellations of the domain. A Matlab package, called MDDS, for computing the Bézier net both in the trivariate and bivariate cases, is also provided.     

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).     

两条Bézier样条的光滑连接

研究了用一条样条曲线把两条不相连接的样条曲线光滑连接起来的问题,给出了连接两条一元n次参数样条曲线为一条新的一元n次参数样条曲线的条件,适用于参数样条曲线添加控制顶点的情形,进一步得到了两条一次、二次、三次Bézier样条曲线在几何连续性下实现自然光滑连接的条件.     

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     

Geometric meanings of the parameters on rational conic segments

Using algebraic and geometric methods,functional relationships between a point on a conic segment and its corresponding parameter are derived when the conic segment is presented by a rational quadratic or cubic Bézier curve.That is,the inverse mappings of the mappings represented by the expressions of rational conic segments are given.These formulae relate some triangular areas or some angles,determined by the selected point on the curve and the control points of the curve,as well as by the weights of the rational Bézier curve.Also,the relationship can be expressed by the corresponding parametric angles of the selected point and two endpoints on the conic segment,as well as by the weights of the rational Bézier curve.These results are greatly useful for optimal parametrization,reparametrization,etc.,of rational Bézier curves and surfaces.     

点集Bézier曲线

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