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.     

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.     

Hybrid polynomial approximation to higher derivatives of rational curves

In this paper, we extend the results published in JCAM volume 214 pp. 163-174 in 2008. Based on the bound estimates of higher derivatives of both Bernstein basis functions and rational Bézier curves, we prove that for any given rational Bézier curve, if the convergence condition of the corresponding hybrid polynomial approximation is satisfied, then not only the l-th (l=1,2,3) derivatives of its hybrid polynomial approximation curve uniformly converge to the corresponding derivatives of the rational Bézier curve, but also this conclusion is tenable in the case of any order derivative. This result can expand the area of applications of hybrid polynomial approximation to rational curves in geometric design and geometric computation.     

The dual bases for the Bézier-Said-Wang type generalized Ball polynomial bases and their applications

A unifying representation for the existing generalized Ball bases and the Bernstein bases are given. Then the dual bases for the Bézier-Said-Wang type generalized bases (BSWGB for short) are presented. The Marsden identity and the mutual transformation formulas between Bézier curve and Bézier-Said-Wang type generalized curve (BSWGB curve) are also given. These results are very useful for the applications of BSWGB curves and their popularization in CAGD. Numerical examples are also given to show the effectiveness of our methods.     

Smooth polynomial approximation of spiral arcs

Constructing fair curve segments using parametric polynomials is difficult due to the oscillatory nature of polynomials. Even NURBS curves can exhibit unsatisfactory curvature profiles. Curve segments with monotonic curvature profiles, for example spiral arcs, exist but are intrinsically non-polynomial in nature and thus difficult to integrate into existing CAD systems. A method of constructing an approximation to a generalised Cornu spiral (GCS) arc using non-rational quintic Bézier curves matching end points, end slopes and end curvatures is presented. By defining an objective function based on the relative error between the curvature profiles of the GCS and its Bézier approximation, a curve segment is constructed that has a monotonic curvature profile within a specified tolerance.     

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.     

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.     

On parametrization of interpolating curves

In parametric curve interpolation there is given a sequence of data points and corresponding parameter values (nodes), and we want to find a parametric curve that passes through data points at the associated parameter values. We consider those interpolating curves that are described by the combination of control points and blending functions. We study paths of control points and points of the interpolating curve obtained by the alteration of one node. We show geometric properties of quadratic Bézier interpolating curves with uniform and centripetal parameterizations. Finally, we propose geometric methods for the interactive modification and specification of nodes for interpolating Bézier curves.     

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.     

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.     

Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes

We present two numerical methods to approximate the shortest path or a geodesic between two points on a three-dimensional parametric surface. The first one consists of minimizing the path length, working in the parameter domain, where the approximation class is composed of Bézier curves. In the second approach, we consider Bézier surfaces and their control net. The numerical implementation is based on finding the shortest path on the successive control net subdivisions. The convergence property of the Bézier net to the surface gives an approximation of the required shortest path. These approximations, also called pseudo-geodesics, are then applied to the creation of pseudo-geodesic meshes. Experimental results are also provided.     

Bézier curves and interpolation in Riemannian manifolds

In a connected Riemannian manifold, generalised Bézier curves are C^∞ curves defined by a generalisation, in which line segments are replaced by minimal geodesics, of the classical de Casteljau algorithm. As in Euclidean space, these curves join their first and last control points. We compute the endpoint velocities and (covariant) accelerations of a generalised Bézier curve of arbitrary degree and use the formulae to express the curve's control points in terms of these quantities. These results allow generalised Bézier curves to be pieced together into C² splines, and thereby allow C² interpolation of a sequence of data points. For the case of uniform splines in symmetric spaces, we show that C² continuity is equivalent to a simple relationship, involving the global symmetries at knot points, between the control points of neighbouring curve segments. We also present some examples in hyperbolic 2-space.     

New control massic polygon of a B-rational curve resulting from a homographic change of parameter

We deal with the homographic and affine change of parameter of rational curves represented as BR-curves. Forcomputational purposes in CAGD and CAM we determine the new massic polygon through four different methods and we study the particular case of Bézier curves among the applications.     

Necessary and sufficient conditions for rational quartic representation of conic sections

Conic section is one of the geometric elements most commonly used for shape expression and mechanical accessory cartography. A rational quadratic Bézier curve is just a conic section. It cannot represent an elliptic segment whose center angle is not less than π$\pi$. However, conics represented in rational quartic format when compared to rational quadratic format, enjoy better properties such as being able to represent conics up to 2π$2\pi$ (but not including 2π$2\pi$) without resorting to negative weights and possessing better parameterization. Therefore, it is actually worth studying the necessary and sufficient conditions for the rational quartic Bézier representation of conics. This paper attributes the rational quartic conic sections to two special kinds, that is, degree-reducible and improperly parameterized; on this basis, the necessary and sufficient conditions for the rational quartic Bézier representation of conics are derived. They are divided into two parts: Bézier control points and weights. These conditions can be used to judge whether a rational quartic Bézier curve is a conic section; or for a given conic section, present positions of the control points and values of the weights of the conic section in form of a rational quartic Bézier curve. Many examples are given to show the use of our results.     

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.     

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.     

Shape parameter deletion for Pólya curves

We present a simple change of basis technique for transforming one type of Pólya curve to another closely related Pólya curve form. Repeated use of this method yields algorithms for transforming one arbitrary Pólya form to another, as well as algorithms for evaluating, subdividing, and differentiating Pólya curves. These procedures can be applied to almost all Pólya curves, including Bézier curves and Lagrange interpolating polynomials.     

On the quartic curve of Han

The quartic curve of Han [X. Han, Piecewise quartic polynomial curves with shape parameter, Journal of Computational and Applied Mathematics 195 (2006) 34–45] can be considered as the generalization of the cubic B-spline curve incorporating shape parameters into the polynomial basis functions. We show that this curve can be considered as the linear blending of the original cubic B-spline curve and a fixed quartic curve. Moreover, we present the Bézier form of the curve, which is useful in terms of incorporating the curve into existing CAD systems. Geometric effects of the alteration of shape parameters is also discussed, including design oriented computational methods for constrained shape control of the curve.     

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.     

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.