B-Spline曲线聚风装置直线翼垂直轴风力机启动性能数值模拟

为了提升直线翼垂直轴风力机的启动性能,基于B-Spline曲线生成方法,提出一种具有流线型轮廓的聚风装置,将其分别安装在风轮顶端和底端,用以提升风轮附近的来流风速,使风轮汲取更多风能,达到更易启动的特点.选取聚风装置的5个结构参数进行设计:聚风装置与风轮间隙距离ΔL、底圆半径R_(1)、顶圆半径R_(2)、入口角度α_(1)和出口角度α_(2).设计方法采用二次旋转正交组合筛选最优模型,通过三维数值模拟研究聚风装置参数对直线翼垂直轴风力机启动性能的影响,获得了最佳外形参数组合.此外,对有无加装聚风装置的直线翼垂直轴风力机进行了静态三维数值模拟.结果表明,通过添加具有外凸流线型轮廓的聚风装置,直线翼垂直轴风力机的启动性能有显著提升.在风速较低的情况下,性能改善更加明显.聚风装置可使直线翼垂直轴风力机的平均启动力矩系数最大增加38.8%,峰值平均启动力矩系数最大可增加31.2%.

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.

Bézier curves with shape parameter

In this paper, Bézier basis with shape parameter is constructed by an integral approach. Based on this basis, we define the Bézier curves with shape parameter. The Bézier basis curves with shape parameter have most properties of Bernstein basis and the Bézier curves. Moreover the shape parameter can adjust the curves’ shape with the same control polygon. As the increase of the shape parameter, the Bézier curves with shape parameter approximate to the control polygon. In the last, the Bézier surface with shape parameter is also constructed and it has most properties of Bézier surface.

Rational offset approximation of rational Bézier curves

The problem of parametric speed approximation of a rational curve is raised in this paper. Offset curves are widely used in various applications. As for the reason that in most cases the offset curves do not preserve the same polynomial or rational polynomial representations, it arouses difficulty in applications. Thus approximation methods have been introduced to solve this problem. In this paper, it has been pointed out that the crux of offset curve approximation lies in the approximation of parametric speed. Based on the Jacobi polynomial approximation theory with endpoints interpolation, an algebraic rational approximation algorithm of offset curve, which preserves the direction of normal, is presented.

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.

A fast direct point-by-point generating algorithm for B Spline curves and surfaces

Traditional generating algorithms for B Spline curves and surfaces require approximation methods where how to increment the parameter to get the best approximation is problematic; or they take the pixel-based method needing matrix trans- formation from B Spline representation to Bézier form. Here, a fast, direct point-by-point generating algorithm for B Spline curves and surfaces is presented. The algorithm does not need matrix transformation, can be used for uniform or nonuniform B Spline curves and surfaces of any degree, and has high generating speed and good rendering accuracy.

Approximate merging of B-spline curves and surfaces

Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.

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 class of quasi Bézier curves based on hyperbolic polynomials

This paper presents a basis for the space of hyperbolic polynomials Гm=span { 1, sht, cht, sh2t, ch2t shmt, chmt} on the interval [0,a] from an extended Tchebyshev system, which is analogous to the Bernstein basis for the space of polynomial used as a kind of well-known tool for free-form curves and surfaces in Computer Aided Geometry Design. Then from this basis, we construct quasi Bézier curves and discuss some of their properties. At last, we give an example and extend the range of the parameter variable t to arbitrary close interval [r, s] （r〈s）.

Shape modification of Bézier curves by constrained optimization

The Bézier curve is one of the most commonly used parametric curves in CAGD and Computer Graphics and has many good properties for shape design. Developing more convenient techniques for designing and modifying Bézier curve is an im- portant problem, and is also an important research issue in CAD/CAM and NC technology fields. This work investigates the optimal shape modification of Bézier curves by geometric constraints. This paper presents a new method by constrained optimi- zation based on changing the control points of the curves. By this method, the authors modify control points of the original Bézier curves to satisfy the given constraints and modify the shape of the curves optimally. Practical examples are also given.

One Fairing Method of Cubic B-spline Curves Based on Weighted Progressive Iterative Approximation

A new method to the problem of fairing planar cubic B-spline curves is introduced in this paper. The method is based on weighted progressive iterative approximation （WPIA for short） and consists of following steps： finding the bad point which needs to fair, deleting the bad point, re-inserting a new data point to keep the structm-e of the curve and applying WPIA method with the new set of the data points to obtain the faired curve. The new set of the data points is formed by the rest of the original data points and the new inserted point. The method can be used for shape design and data processing. Numerical examples are provided to demonstrate the effectiveness of the method.

C^n-CONTINUOUS B-TYPE SPLINE CURVES WITH ITSLOCALIZATION INTERPOLATION AND APPROXIMATION

This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.

RECONSTRUCTION OF SYMMETRIC B-SPLINE CURVES AND SURFACES

A method to reconstruct symmetric B-spline curves and surfaces is presented. The symmetry property is realized by using symmetric knot vector and symmetric control points. Firstly, data points are divided into two parts based on the symmetry axis or symmetry plane extracted from data points. Then the divided data points are parameterized and a symmetric knot vector is selected in order to get symmetric B-spline basis functions. Constraint equations regarding the control points are deduced to keep the control points of the B-spline curve or surface to be symmetric with respect to the extracted symmetry axis or symmetry plane. Lastly, the constrained least squares fitting problem is solved with the Lagrange multiplier method. Two examples from industry are given to show that the proposed method is efficient, robust and able to meet the general engineering requirements.

Bézier和B-spline曲线的绝对结点坐标列式有限元离散方法

CAD系统中广泛采用Bézier,B-spline描述复杂的几何形状,而传统有限元则采用完全不同的插值函数来描述分析模型,对几何形状的不同描述导致由CAD模型转换为有限元模型非常困难,且带来模型上的不一致。研究Bézier和B-spline曲线离散为绝对结点坐标列式(Absolute nodal coordinate formulation,ANCF)有限单元的方法,建立Bézier和B-spline曲线与ANCF索单元之间的线性转换关系,实现了两者之间的自动转换,从而为整合CAD和CAA系统提供一种方法,表明ANCF单元可完全涵盖Bézier曲线的特性,Bézier表达其实是ANCF表达的特例,采用ANCF单元可以精确表达Bézier和B-spline曲线。同时研究了B-spline曲线的连续性与ANCF单元结点之间的连续性关系,B-spline采用节点重复度控制所定义图形的连续性,ANCF单元因为采用位置和位置导数作为结点坐标可以自动保证C1连续,C2连续性要求实际上是在单元之间添加曲率相等的约束方程,从而实现消除一个位置导数坐标;对于3阶曲线,证明C3连续性要求下任意两个ANCF单元均可以合并为一个大的单元。进而得出在实际转换和分析中不必通过添加约束方程得到不同的连续性,可以直接由B-spline表达得到不同连续性要求的ANCF单元网格。以悬臂梁在冲击作用下的动态响应为例说明了不同的连续性要求对有限元分析的影响。

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.

THE RELATIONSHIP BETWEEN PROJECTIVE GEOMETRIC AND RATIONAL QUADRATIC B-SPLINE CURVES

Abstract For two rational quadratic B spline curves with same control vertexes, the cross ratio of four collinear points are represented: which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the two curves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Bézier curves, the value is generally related with the location of the ray, and the necessary and sufficient condition of the ratio being independent of the ray's location is showed. Also another cross ratio of the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initial vertex intersects respectively with the curve segment, the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only with the ray's location, but not with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments.

基于五次B样条的工业机器人轨迹优化

为提高工业机器人的工作效率,提出一种以时间最优为目标的轨迹优化方法,在5次B样条曲线轨迹规划原理的基础上,引入遗传算法对轨迹进行优化。针对工作时间建立适应度函数,并通过选择交叉概率和变异概率操作产生新的轨迹解,与未被淘汰的父代组成新的种群,经过迭代求得运行时间最优的期望解。利用MATLAB软件对这一方法进行仿真,结果表明,经分析遗传算法优化后,轨迹运行时间明显减少,且具有良好的轨迹效果。