B样条乘积计算的区间跳跃算法及应用

利用B样条基函数节点区间的对应关系,首先给出了B样条基函数间的转换矩阵的计算方法,进而给出了计算B样条乘积的区间跳跃算法。该算法仅需计算部分节点区间上的转换矩阵,因此称其为区间跳跃算法。这一方法解决了分段多项式与B样条曲线乘积的计算问题,可应用到B样条曲线的升阶、曲面间光滑拼接等问题中。通过算例验证了该方法计算简捷、易于实现。     

基于四点分段的一类三角多项式曲线

提出了一类m(m=1,2,3)次分段三角多项式曲线，通过引入形状参数，给出了加权三角多项式曲线，与三次B样条曲线类似。每段三角多项式曲线由4个相继的控制点生成，对于等距节点的情形，所提出的三角多项式曲线是C^2m-1连续；给出了三角开曲线和闭曲线的构造方法。论述了椭圆的表示方法，给出了三角多项式曲线与三次B样条曲线的对比，通过改变次数m或调整形状参数，可以得到不同程度地接近于控制多边形的曲线，因此，所给曲线的生成方法是一种结构简单和使用方便的曲线生成方法。     

NURBS曲线曲面的显式矩阵表示及其算法

从 B样条的差商定义出发 ,提出差商展开系数的概念 ,通过差商展开系数显式解析表示式的导出 ,得到任意次 NU RBS曲线曲面系数矩阵的显式解析表示式 ,并给出了求差商展开系数和 NURBS曲线曲面系数矩阵的数值算法 .文中给出的方法适用于一切 NU RBS曲线曲面 ,包括有理和非有理的 Bézier、均匀和非均匀的 B样条曲线曲面 .相应的数值算法计算简单 ,易于实现 .差商展开系数解析表示式为 NU RBS曲线曲面的表示、转换和节点插入、升阶等基本运算以及与差商相关的问题的研究提供了一个统一的构造性工具和应用方法 .     

Reducing control points in lofted B-spline surface interpolation using common knot vector determination

A new algorithm for reducing control points in lofted surface interpolation to rows of data points is presented in this paper. The key step of surface lofting is to obtain a set of compatible B-spline curves interpolating each row. Given a set of points and their parameterization, a necessary and sufficient condition is proposed to determine the existence of interpolating B-spline curves defined on a given knot vector. Based on this condition, we first properly construct a common knot vector that guarantees the existence of interpolating B-spline curves to each row of points. Then we calculate a set of interpolating B-spline curves defined on the common knot vector by energy minimization. Using this method, fewer control points are employed while maintaining a visually pleasing shape of the lofted surface. Several experimental results demonstrate the usability and quality of the proposed method.     

Approximate merging of B-spline curves via knot adjustment and constrained optimization

This paper addresses the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. The basic idea of the approach is to find the conditions for precise merging of two B-spline curves, and perturb the control points of the curves by constrained optimization subject to satisfying these conditions. To obtain a merged curve without superfluous knots, we present a new knot adjustment algorithm for adjusting the end k knots of a kth order B-spline curve without changing its shape. The more general problem of merging curves to pass through some target points is also discussed.     

A Geometric Approach for Multi-Degree Spline

Multi-degree spline (MD-spline for short) is a generalization of B-spline which comprises of polynomial segments of various degrees.The present paper provides a new definition for MD-spline curves in a geometric intuitive way based on an efficient and simple evaluation algorithm.MD-spline curves maintain various desirable properties of B-spline curves,such as convex hull,local support and variation diminishing properties.They can also be refined exactly with knot insertion.The continuity between two adjacent segments with different degrees is at least C1 and that between two adjacent segments of same degrees d is Cd 1.Benefited by the exact refinement algorithm,we also provide several operators for MD-spline curves,such as converting each curve segment into B′ezier form,an efficient merging algorithm and a new curve subdivision scheme which allows different degrees for each segment.     

Lofted B-spline surface interpolation by linearly constrained energy minimization

This paper proposes a new approach for lofted B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. The approach first finds a common knot vector consisting of fewer knots that contain enough degrees of freedom to guarantee the existence of a B-spline curve interpolating each contour. Then, it computes from the contours a set of compatible B-spline curves defined on the knot vector by adopting B-spline curve interpolation based on linearly constrained energy minimization. Finally, it generates a B-spline surface interpolating the curves via B-spline surface lofting. As the energy functional is quadratic, the energy minimization problem leads to that of solving a linear system. The proposed approach is efficient in computation and can realize more efficient data reduction than previous approaches while providing visually pleasing B-spline surfaces. Moreover, the approach works well on measured data with noise. Some experimental results demonstrate its usefulness and quality.     

多帧时间窗轮换算法规划仓储多AGV小车路径

针对在仓储环境中多AGV小车的路径规划问题,提出一种基于多帧时间窗轮换算法。所提算法运用A*寻路算法进行全局路径规划,得到多AGV小车的初始路径离散点的集合。通过在仓储环境岔路口设置多帧时间窗切换阈值,将小车的全局路径点集离散成多帧小窗体,在每个小窗体建立凸集特征最优目标障碍函数,引入小车的运动学约束和防碰撞最优超平面约束,将小车的各种约束参数化为多项式B样条曲线形式,采用牛顿迭代融合回溯直线法更新步长,解决下一帧时间窗多项式B样条曲线控制点的更新问题。最后通过实验测试表明,在满足所有约束的情况下实现多AGV小车的路径规划。     

Eliciting dependability requirements: a control cases based approach

At present,great demands are posed on software dependability.But how to elicit the dependability requirements is still a challenging task.This paper proposes a novel approach to address this issue.The essential idea is to model a dependable software system as a feedforward-feedback control system,and presents the use cases+control cases model to express the requirements of the dependable software systems.In this model,while the use cases are adopted to model the functional requirements,two kinds of control cases(namely the feedforward control cases and the feedback control cases)are designed to model the dependability requirements.The use cases+control cases model provides a unified framework to integrate the modeling of the functional requirements and the dependability requirements at a high abstract level.To guide the elicitation of the dependability requirements,a HAZOP based process is also designed.A case study is conducted to illustrate the feasibility of the proposed approach.     

B-spline surface fitting based on adaptive knot placement using dominant columns

By expanding the idea of B-spline curve fitting using dominant points (Park and Lee 2007 [13]), we propose a new approach to B-spline surface fitting to rectangular grid points, which is based on adaptive knot placement using dominant columns along u- and v-directions. The approach basically takes approximate B-spline surface lofting which performs adaptive multiple B-spline curve fitting along and across rows of the grid points to construct a resulting B-spline surface. In multiple B-spline curve fitting, rows of points are fitted by compatible B-spline curves with a common knot vector whose knots are computed by averaging the parameter values of dominant columns selected from the points. We address how to select dominant columns which play a key role in realizing adaptive knot placement and thereby yielding better surface fitting. Some examples demonstrate the usefulness and quality of the proposed approach.     

集逼近插值于一体的分段3次多项式曲线曲面

为了用一种模型实现逼近与插值的统一,在多项式函数空间上构造了含两组参数的混合函数,并由之定义了基于四点分段的多项式曲线和相应的张量积曲面。当参数取特殊值时,新曲线曲面成为3次均匀B样条曲线曲面。除了继承B样条方法的局部性,自动光滑性等优点之外,新曲线曲面还具有局部形状可调性。限制混合函数中参数的取值范围,可以使新曲线曲面位于控制顶点的凸包内。让混合函数中的一组参数取特定值,可以使新曲线曲面自动插值除边界点以外的控制顶点,且插值曲线曲面的形状依然局部可调。给出了一些曲线曲面图例。     

基于差分进化算法的B 样条曲线曲面拟合

应用B 样条曲线曲面拟合内在形状带有间断或者尖点的数据时,最小二乘法得到的 拟合结果往往在间断和尖点处误差较大,原因在于最小二乘法将拟合函数B 样条的节点固定。本 文在利用3 次B 样条曲线和曲面拟合数据时,应用差分进化算法设计出一种能够自适应地设置B 样条节点的方法,同时对节点的数量和位置进行优化,使得B 样条拟合曲线曲面在间断和尖点处 产生拟多重节点,实现高精度地拟合采样于带有间断或尖点的曲线和曲面数据。     

利用形状参数构造保凸插值的双曲多项式B样条曲线

把一个参数化的奇异多边形与双曲多项式B样务按某一个因子调配,可自动生成带形状参数且插值给定平面点列的C^2（或G^1）连续的双曲多项式B样条曲线．把这一曲线的曲率符号函数写为Bernstein多项式形式,并利用Bernstein多项式的非负性条件,得到形状参数的合适取值来保证样条曲线对插值点列的保凸性．此方法简单、方便,无需解方程组或迭代计算,生成的插值曲线具有较均匀的曲率．大量实例验证了算法的正确与有效．     

二次均匀B样条曲线的扩展

为便于对均匀B样条曲线进行形状修改,利用二次均匀B样条基函数所需满足的条件,扩展二次均匀B样条基函数,构造出三次多项式调配函数．基于给出的调配函数,建立1种带形状参数的分段多项式曲线．调整形状参数可使三次多项式曲线在二次均匀B样条曲线两侧摆动．最后给出实例,构造出带局部调节参数G^1的连续曲线．该方法可以通过调整参数扩大二次均匀B样条曲线的调整范围．     

高精度三次参数样条曲线的构造

构造参数样条曲线的关键是选取节点，该文讨论了GC^2三次参数样条曲线需满足的连续性方程，提出了构造GC^2三次参数样条曲线的新方法，在讨论了平面有序五点确定一组三次多项式函数曲线，平面有序六点唯一确定一条三次多项式函数曲线的基础上，提出了计算相邻两区间上的节点的算法，构造的插值曲线具有三次多项式函数精,该文还以实例对新方法与其它方法构造的插值曲线的精度进行了比较。     

An Extension of Chaiken′s Algorithm to B-Spline Curves with Knots in Geometric Progression

Chaiken′s algorithm is a procedure for inserting new knots into uniform quadratic B-spline curves by doubling the control points and taking two successive averages. Lane and Riesenfeld showed that Chaiken′s algorithm extends to uniform B-spline curves of arbitrary degree. By generalizing the notion of successive averaging, we further extend Chaiken′s algorithm to B-spline curves of arbitrary degree for knot sequences in geometric and affine progression.     

Neural Network Methods for NURBS Curve and Surface Interpolation

New algorithms based on artificial neural network models are presented for cubic NURBS curve and surface interpolation.When all th knot spans are identical,the NURBS curve interpolation procedure degenerates into that of uniform rational B-spline curves.If all the weights of data points are identical,then the NURBS curve interpolation procedure degenerates into the integral B-spline curve interpolation.     

基于二进制GA的B样条重构曲线节点优化

带法向约束的自由曲线曲面重构在光学反射面设计中起至关重要的作用.本文为解决法向约束下的曲线重构问题提出了一种优化方案,使得重构出的曲线在逼近数据点的同时,亦能满足相应法向约束.首先,利用惩罚函数的方法将带法向约束的优化问题转化为无约束的优化问题.然后,引入二进制编码的遗传算法（GA）,建立合适的适应度函数,自适应产生优化节点向量,如此迭代进化,直到产生令人满意的重构曲线为止.考虑到节点向量非递减的特性,而遗传算法在寻找最优节点向量的过程中有可能打乱节点向量的顺序,所以在建立适应度函数的时候将变量调整为无序有界变量.通过与传统最小二乘方法和粒子群智能优化方法的比较,本文方案在解决带法向条件约束的曲线重构问题上优势明显,且对于任意形状的曲线重构都行之有效.     

Bézier样条曲线的近似弧长参数化方法

提出了Bézier样条曲线近似弧长参数化的方法及相应的算法。通过求出曲线近似二分之一弧长的点及其相应的参数值,可将曲线分割为两条Bézier样条曲线。这两条曲线的弧长近似相等,因此让它们带有相同的权1。对新生成的Bézier样条曲线不断重复上述工作,最终得到一条由多条Bézier样条曲线所构成的新的曲线。将这多条Bézier样条曲线合并为一条Bézier样条曲线,进而通过节点插入技术将其转化为B样条形式的曲线以便得到全局参数,其中各段Bézier曲线在全局参数域中所占子区间的长度与它们所具有的权成比例,这样便得到一条近似弧长参数化曲线。     

B样条曲线的节点插入问题及两个新算法

Ｂｏｅｈｍ算法和Ｏｓｌｏ算法是Ｂ产条曲线的节点插入的经典算法，它们可以有效地将节眯插入到端点插值（Ｅｎｄｏｐｏｉｎｔ－ｉｎｔｅｒｏｌａｔｉｎｇ）Ｂ样条曲线，但是，对于其它的Ｂ样条曲线而言，当插入靠近节眯矢量两端附近的节点时，所有的经典算法都将出错，本文提出了两个节点插入新算法，它们可以解决节插入的经典算法中的问题，能够将任意节点插入到各种Ｂ样条曲线之中，它们的另一个重要用途是可以用于各种Ｂ样条曲线