αβ-Bézier曲线的类De Casteljau算法

带形状参数的样条曲线比传统样条曲线有更丰富的曲线表达能力,应用广泛.本文研究了一类带形状参数αβ-Bézier曲线的类De Casteljau算法。首先对带形状参数的αβ-Bernstein基函数进行了扩展,讨论了基函数的相关性质,并给出了任意次数αβ-Bézier曲线的定义。在此基础上基于基函数的递推关系给出了αβ-Bézier曲线的快速求值算法。该算法类似于经典的De Casteljau算法,通过对曲线控制顶点的一系列线性运算来实现。操作简单,比基于参数表达式计算曲线上点值的方法更为高效。计算实例表明了算法的可行性与有效性。

A Novel Contour Tracing Algorithm for Object Shape Reconstruction Using Parametric Curves

Parametric curves such as Bézier and B-splines, originally developedfor the design of automobile bodies, are now also used in image processing andcomputer vision. For example, reconstructing an object shape in an image,including different translations, scales, and orientations, can be performedusing these parametric curves. For this, Bézier and B-spline curves can be generatedusing a point set that belongs to the outer boundary of the object. Theresulting object shape can be used in computer vision fields, such as searchingand segmentation methods and training machine learning algorithms. Theprerequisite for reconstructing the shape with parametric curves is to obtainsequentially the points in the point set. In this study, a novel algorithm hasbeen developed that sequentially obtains the pixel locations constituting theouter boundary of the object. The proposed algorithm, unlike the methods inthe literature, is implemented using a filter containing weights and an outercircle surrounding the object. In a binary format image, the starting point ofthe tracing is determined using the outer circle, and the next tracing movementand the pixel to be labeled as the boundary point is found by the filter weights.Then, control points that define the curve shape are selected by reducing thenumber of sequential points. Thus, the Bézier and B-spline curve equationsdescribing the shape are obtained using these points. In addition, differenttranslations, scales, and rotations of the object shape are easily provided bychanging the positions of the control points. It has also been shown that themissing part of the object can be completed thanks to the parametric curves.

A synthetic aperture radar sea surface distribution estimation by n-order Bézier curve and its application in ship detection

To dates,most ship detection approaches for single-pol synthetic aperture radar（SAR） imagery try to ensure a constant false-alarm rate（CFAR）.A high performance ship detector relies on two key components：an accurate estimation to a sea surface distribution and a fine designed CFAR algorithm.First,a novel nonparametric sea surface distribution estimation method is developed based on n-order Bézier curve.To estimate the sea surface distribution using n-order Bézier curve,an explicit analytical solution is derived based on a least square optimization,and the optimal selection also is presented to two essential parameters,the order n of Bézier curve and the number m of sample points.Next,to validate the ship detection performance of the estimated sea surface distribution,the estimated sea surface distribution by n-order Bézier curve is combined with a cell averaging CFAR（CA-CFAR）.To eliminate the possible interfering ship targets in background window,an improved automatic censoring method is applied.Comprehensive experiments prove that in terms of sea surface estimation performance,the proposed method is as good as a traditional nonparametric Parzen window kernel method,and in most cases,outperforms two widely used parametric methods,K and G0 models.In terms of computation speed,a major advantage of the proposed estimation method is the time consuming only depended on the number m of sample points while independent of imagery size,which makes it can achieve a significant speed improvement to the Parzen window kernel method,and in some cases,it is even faster than two parametric methods.In terms of ship detection performance,the experiments show that the ship detector which constructed by the proposed sea surface distribution model and the given CA-CFAR algorithm has wide adaptability to different SAR sensors,resolutions and sea surface homogeneities and obtains a leading performance on the test dataset.

Improvement of the termination criterion for subdivision of the rational Bézier curves

By using some elementary inequalities, authors in this paper makes further improvement for estimating the heights of Bézier curve and rational Bézier curve. And the termination criterion for subdivision of the rational Bézier curve is also improved. The conclusion of the extreme value problem is thus further confirmed.

Multi-Degree Reduction of Bézier Curves with Distance and Energy Optimization

In this paper, we propose a new approach to the problem of degree reduction of Bézier curves based on the given endpoint constraints. A differential term is added for the purpose of controlling the smoothness to a certain extent. Considering the adjustment of second derivative in curve design, a modified objective function including two parts is constructed here. One part is a kind of measure of the distance between original high order Bézier curve and degree-reduced curve. The other part represents the second derivative of degree-reduced curve. We tackle two kinds of conditions which are position vector constraint and tangent vector constraint respectively. The explicit representations of unknown points are presented. Some examples are illustrated to show the influence of the differential terms to approximation and smoothness effect.

Unifying representation of Bézier curve and two kinds of generalized ball curves

This paper presents a new basis, the WSB basis, which unifies the Bemstein basis, Wang-Ball basis and Said-Ball basis, and therefore the Bézier curve, Wang-Ball curve and Said-Ball curve are the special cases of the WSB curve based on the WSB basis In addition, the relative degree elevation formula, recursive algorithm and conversion formula between the WSB basis and the Bern- stein basis are given.

Sine Transformation and the Reparametrization of Bézier Curves

A solution to the reparametrization of Bézier curves by sine transformation of Bemstein basis is presented. The new effective reparametrization method is given through the following procedures： educing Sine Bemstein-Bézier Class-SBBC function, defining SBBC curve and discussing the relation between SBBC and Bézier curve.

PH-spline approximation for Bézier curve and rendering offset

In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors between PH-spline and the Bzier curve, the offset to PH-spline and the offset to the given Bzier curve are also estimated. A new algorithm for constructing offset to the Bzier curve is proposed.

A New Fractional Rational Bézier Curve

Based on rational Bézier curves given by Ron Goldman, a new fractional rational Bézier curve was first defined in terms of fractional Bernstein bases. Moreover, some basic properties were dicussed and a theorem connected to Poisson curves was obtained. Some examples in this paper were given by the visual results.

An optimization method for rational Bézier curve design

Adjusting weights as a shape control tool in rational B6zier curve design is not easy because the weights have a global in- fluence. The curve could not approximate control polygon satisfactorily by an interactive manner. In order to produce a curve close enough to control polygon at every control vertex, an optimization model is established to minimize the distance between rational B6zier curve and its control points. This optimization problem is converted to a quadratic programming problem by separating and recombining the objective function. The new combined multi-objective optimization problem is reasonable and easy to solve. With an optimal parameter, the computing process is discussed. Comparative examples show that the designed curve is closer to control polygon and preserves the shape of the control polygon well.

COMPUTING AREAS BOUNDED BYRATIONAL BEZIER CURVES

An approach is presented for computing integral values, such as areas and volumes of revo-lution . of regions bounded by rational plane B zier curves. The method approximates rational curveswith polynomial curves, and then computes the integral values on those polynomial curves. Errorbounds are provided. For high precision, this new algorithm performs much more quickly than con-ventional numerical methods.

n次λ-Bézier曲线光滑拼接的连续性条件

针对n次λ-Bézier曲线造型中的复杂曲线难以用单一曲线来构造的问题,研究了该曲线光滑拼接时的连续性条件。通过分析λ-Bézier曲线的基函数及其端点性质,给出了相邻两段λ-Bézier曲线间C1、C2和G1、G2光滑拼接的充要条件;最后,给出了λ-Bézier曲线光滑拼接的具体步骤与几何造型实例,并分析了形状参数对拼接后曲线形状的影响规律。实例结果表明,所提方法不仅易实现且简单有效,在工程复杂曲面的构造与外形设计中将有一定的应用价值。

三次T-Bézier曲线的光顺延拓

将曲线的最小物理变形能量作为目标函数,提出了一种三次T-Bézier曲线曲面的光顺延拓算法。利用G2连续性作为约束条件,则延拓的曲线具有两个自由度,并取其中的一个自由度为零;基于延拓曲线的最小物理变形能量确定第二个自由度及延拓曲线的控制点,进而确定延拓曲线,重新参数化所延拓的曲线可以与原曲线在拼接点处C3连续拼接;此外,将该方法应用于双三次T-Bézier曲面的延拓。实例表明,该方法构造的曲线曲面具有较好的光顺性。

基于四次ω-Bézier曲线的陶瓷产品造型设计

用一条四次ω-Bézier曲线描述了陶瓷产品中的线形;提出利用2段四次ω-Bézier曲线的级连续获得产品的光滑轮廓曲线,通过改变控制顶点位置和形参值,快速获得大量优秀造型方案的方法。该方法基于四次ω-Bézier曲线生成与连接原理则,计算量小,操作简单,生成的线形流畅,符合用户的审美要求,具有良好的应用前景。

Bézier曲线到AH-Bézier曲线的升阶算法

关于曲线升阶,已有的结论往往限于同类曲线之间。为了突破这一限制,考虑不同类曲线间的升阶,关注代数多项式空间中的Bézier曲线到代数双曲多项式空间中的AH-Bézier曲线的升阶。研究从基函数入手,利用Bézier和AH-Bézier共有的求导降阶的特点,结合矩阵分块的思想,先给出AH-Bézier基到Bernstein基的转换矩阵,进而推出控制顶点的升阶公式,最后给出升阶算法。结果表明,任意n次Bézier曲线可以通过该算法升到n+3阶(等同于n+2次)的AH-Bézier曲线。算法实现了Bézier到AH-Bézier曲线模型的精确转换。

λαβ-Bézier曲线与3次Bézier曲线的拼接条件

利用Bézier样条曲线光滑拼接的方法,研究了带形状参数的Bézier曲线与Bézier曲线的拼接问题,得出了Bézier曲线与λαβ-Bézier的G0、G1、G2光滑拼接条件,拓广了λαβ-Bézier曲线的应用.

平面G^2组合三次α-Bézier曲线的几何构造

对三次曲线的几何连续拼接问题做了研究。给出了构造平面G2组合三次a-B閦ier曲线的几何算法。这个算法,可以对给定的一组平面控制顶点,方便地构造一条G2三次a-B閦ier样条曲线。这种样条保留了B样条、样条的性质,优点在于保持曲线G2连续,同时通过选取不同的混合因子和形状因子,局部调整曲线的形状,以满足不同的设计要求。

Energy-Minimizing Curve Fitting for High-Order Surface Mesh Generation

We investigate different techniques for fitting Bézier curves to surfaces in context of high-order curvilinear mesh generation. Starting from distance-based least-squares fitting we develop an incremental algorithm, which incorporates approximations of stretch and bending energy. In the process, the algorithm reduces the energy weight in favor of accuracy, leading to an optimized set of sampling points. This energy-minimizing fitting strategy is applied to analytically defined as well as triangulated surfaces. The results confirm that the proposed method straightens and shortens the curves efficiently. Moreover the method preserves the accuracy and convergence behavior of distance-based fitting. Preliminary application to surface mesh generation shows a remarkable improvement of patch quality in high curvature regions.

Curve intersection based on cubic hybrid clipping

This study presents a novel approach to computing all intersections between two Bézier curves using cubic hybridclipping. Each intersection is represented by two strip intervals that contain an intersection. In each step, one curve isbounded by two fat lines, and the other is bounded by two cubic Bézier curves, clipping away the domain that doesnot contain the intersections. By selecting the moving control points of the cubic hybrid curves, better cubic polynomial bounds are obtained to make the proposed method more efficient. It was proved that the two strip intervalshave second- and fourth-order convergence rates for transversal intersections. Experimental results show that thenew algorithm is the most efficient among all existing curve/curve intersection approaches.

n次有理Bézier曲线与C-B样条曲线的连续性条件

三次有理B e zier曲线不能随着工程造型的需要而随时改变其次数,因此本文根据n次有理B e zier曲线和C-B样条曲线的一些性质,给出了C-B样条曲线与n次有理B e zier曲线的三种拼接条件,即G^0、G^1、G^2连续,由于n次有理B e zier曲线能够随意的改变其次数,从而可以被应用于CAD/CAM中.