Construction of Bézier Surfaces from Prescribed Boundary

In this paper, we present a method for generating Bézier surfaces from the boundary information based on a general second order functional and a third order functional associated with the triharmonic equation. By solving simple linear equations, the internal control points of the resulting Bézier surface can be obtained as linear combinations of the given boundary control points. This is a generalization of previous works on Plateau-Bézier problem, harmonic, biharmonic and quasi-harmonic Bézier surfaces. Some representative examples show the effectiveness of the presented method.     

一类有理Bézier曲线的等距线算法及MATLAB实现

构造一类正则有理Bézier曲线,利用改进的有理de casteljau算法求得这类正则有理n次Bézier曲线各点处的切矢,由此得出各点的单位法矢量,应用于原始曲线等距线的计算.该方法几何意义明显,算法简洁,实践效果比较好.同时给出了用Matlab绘制有理Bézier曲线及其等距线的程序,准确快捷,实践效果较好.     

On the Structure of Bézier Nets

The distance between two neighbouring multivariate Bézier nets is proved to be $O(m^{-2})$ in this paper. As a consequence, the sequence of Bézier nets is uniformly convergent with the optimal approximation order $O(m^{-1})$. Furthermore, the structures of Bézier nets are explored by investigating how the piecewise linear surface tends to the Bézier surface of $C^{\infty}$.     

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.     

C-Bézier曲线降阶的B网扰动和约束优化法

基于B网扰动和约束优化方法,对n次C-Bézier曲线控制多边形顶点进行扰动,并找到其退化为n-1次次C-Bézier曲线的条件.在满足退化条件的约束下,使n次C-Bézier曲线控制多边形顶点扰动量最小,由此找到降阶为n-1次的C-Bézier曲线,同时也研究了在C~0,C~1连续条件下对n次C-Bézier曲线降阶的B网扰动和约束优化方法.给出了扰动显示格式计算方法和降阶逼近的误差估计式.     

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.     

带两个形状参数的五次Bézier曲线的扩展

给出了一组含有两个形状参数α,β的六次多项式基函数,是五次Bernstein基函数的扩展,分析了这组基的性质;基于这组基定义了带两个形状参数的多项式曲线,所定义的曲线具有五次Bézier曲线的性质,改变参数α,β的取值,曲线具有更灵活的形状可调性,而且能向上或从两侧逼近控制多边形.另外,经典的五次Bézier曲线和有关文献中带一个形状参数的曲线均是该文所定义曲线的特例.实例表明,定义的曲线为曲线/曲面的设计提供了一种有效的方法.     

New Trigonometric Basis Possessing Exponential Shape Parameters

Four new trigonometric Bernstein-like basis functions with two exponential shape parameters are constructed, based on which a class of trigonometric Bézier-like curves, analogous to the cubic Bézier curves, is proposed. The corner cutting algorithm for computing the trigonometric Bézier-like curves is given. Any arc of an ellipse or a parabola can be represented exactly by using the trigonometric Bézier-like curves. The corresponding trigonometric Bernstein-like operator is presented and the spectral analysis shows that the trigonometric Bézier-like curves are closer to the given control polygon than the cubic Bézier curves. Based on the new proposed trigonometric Bernstein-like basis, a new class of trigonometric B-spline-like basis functions with two local exponential shape parameters is constructed. The totally positive property of the trigonometric B-spline-like basis is proved. For different values of the shape parameters, the associated trigonometric B-spline-like curves can be $C^2$ ∩ $FC^3$ continuous for a non-uniform knot vector, and $C^3$ or $C^5$ continuous for a uniform knot vector. A new class of trigonometric Bézier-like basis functions over triangular domain is also constructed. A de Casteljau-type algorithm for computing the associated trigonometric Bézier-like patch is developed. The conditions for $G^1$ continuous joining two trigonometric Bézier-like patches over triangular domain are deduced.     

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.     

Spline R-Function and Applications in FEM

R-function is a widely used tool when considering objects obtained through the Boolean operations start from simple base primitives. However, there is square root operation in the representation. Considering that the use of splines will facilitate the calculations within the CAD system, in this paper, we propose a system of R-functions represented in spline form called Spline R-function (SR). After transforming the function ranges of two base primitives to a new coordinate system, a series of sign constraints following a specific Boolean operation are derived and the spline R-function can be formulated as a piecewise function. Representation of SR in both Bézier form and B-spline form have been given. Among which the Bézier ordinates are determined with the help of the B-net method through setting up a series of relations according to the sign constraints and properties of R-functions. The construction processes for both Boolean intersection and union operations with different smoothness are discussed in detail. Numerical experiments are conducted to show the potential of the proposed spline R-function.     

DEVELOPABLE SURFACE PATCHES BOUNDED BY NURBS CURVES

In this paper we construct developable surface patches which are bounded by two rational or NURBS curves, though the resulting patch is not a rational or NURBS surface in general. This is accomplished by reparameterizing one of the boundary curves. The reparameterization function is the solution of an algebraic equation. For the relevant case of cubic or cubic spline curves, this equation is quartic at most, quadratic if the curves are Bézier or splines and lie on parallel planes, and hence it may be solved either by standard analytical or numerical methods.     

Algorithms and Identities for(q,h)-Bernstein Polynomials and(q,h)-Bézier Curves–A Non-Blossoming Approach

We establish several fundamental identities,including recurrence relations,degree elevation formulas,partition of unity and Marsden identity,for quantum Bernstein bases and quantum Bézier curves.We also develop two term recurrence relations for quantum Bernstein bases and recursive evaluation algorithms for quantum Bézier curves.Our proofs use standard mathematical induction and other elementary techniques.     

矩形域与三角域Bézier曲面间的PPGn变换

Geometric continuity is a very important issue in CAGD and has gained more attention. In this paper we present the new concept of polynomial preserving Gn continuity (PPGn) between rectangular and triangular Bézier surfaces. Necessary and sufficient conditions of PPGn are established explicitly. A simple and useful sufficient condition is also presented. The results can be used more effectively in connecting surfaces and composing rectangular and triangular patches.     

对于局部有界函数的积分型Szász-Bézier算子的逼近估计

引入一种积分型的 Szász- Bézier算子 ,并研究其逼近性质 ,得到了此类算子对局部有界函数的逼近阶估计公式     

Exponential Time Differencing-Padé Finite Element Method for Nonlinear Convection-Diffusion-Reaction Equations with Time Constant Delay

In this paper, ETD3-Padé and ETD4-Padé Galerkin finite element methods are proposed and analyzed for nonlinear delayed convection-diffusion-reaction equations with Dirichlet boundary conditions. An ETD-based RK is used for time integration of the corresponding equation. To overcome a well-known difficulty of numerical instability associated with the computation of the exponential operator, the Padé approach is used for such an exponential operator approximation, which in turn leads to the corresponding ETD-Padé schemes. An unconditional $L^2$ numerical stability is proved for the proposed numerical schemes, under a global Lipshitz continuity assumption. In addition, optimal rate error estimates are provided, which gives the convergence order of $O(k^{3}+h^{r})$ (ETD3-Padé) or $O(k^{4}+h^{r})$ (ETD4-Padé) in the $L^2$ norm, respectively. Numerical experiments are presented to demonstrate the robustness of the proposed numerical schemes.     

三角域上Said-Bézier型广义Ball基的对偶泛函及其应用

A family of Said-Bézier type generalized Ball(SBGB) bases and surfaces with a parameter H over triangular domain is introducermediate surfaces.To convert different bases and surfaces,the dual functionals of bases are presented.As an application of dual functionals,the subdivision formulas for surfaces are established.     

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.     

The Manifold-Valued Dirichlet Problem for Symmetric Diffusions

Harmonic maps between two Riemannian manifolds M and N are often constructed as energy minimizing maps. This construction is extended for the Dirichlet problem to the case where the Riemannian energy functional on M is replaced by a more general Dirichlet form. We obtain weakly harmonic maps and prove that these maps send the diffusion to N-valued martingales. The basic tools are the reflected Dirichlet space and the stochastic calculus for Dirichlet processes.     

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.     

On Computing Zeros of a Bivariate Bernstein Polynomial

1.IntroductionIn[6]and[4],theproblemoffindingtheintersectionofacubicB6zierpatchandaplanewasconsidered.[6]consideredarectangular,and[41atriangularpatch.SincetheBernsteinoperatorB.:f-Bn(f)preserveslinearfunctions,theproblemwassimplifiedtothecomputationofzerosofabivariateBernsteinpolynomialB.(f).BothpaPersproducedsimpleandefficientcomputationalalgorithms.Itisbaseduponthefollowingidea:determinethepointswhereinsidethesupportthetopologyofzerosofB.(f)changes.Thiswasdonebyrestrictingthebivariatepo…