二次均匀B样条曲线的双圆弧逼近方法*

提出了一种用双圆弧对二次均匀B样条曲线的分段逼近方法。首先,对一条具有n 1个控制顶点的二次均匀B样条曲线按照相邻两节点界定的区间分成n-1段只有三个控制顶点的二次均匀B样条曲线段;然后对每一曲线段构造一条双圆弧进行逼近。所构造的双圆弧满足端点及端点切向量条件,即双圆弧的两个端点分别是所逼近的曲线段的端点,而且双圆弧在两个端点处的切向量是所逼近的曲线段在端点处的单位切向量。同时,双圆弧的连接点是双圆弧连接点轨迹圆与其所逼近的曲线段的交点。这些新构造出来的双圆弧连接在一起构成了一条圆弧样条曲线,即二次均匀B样条曲线的逼近曲线。另外给出了逼近误差分析和实例说明。     

曲线曲面逼近与插值的统一表示

为了用一种模型实现从逼近到插值的转换,在多项式空间上构造了含一个参数的调配函数,由之定义了基于4点分段的曲线,该曲线可以理解为由相同的一组控制顶点定义的逼近曲线和插值曲线的线性组合,其中的逼近曲线为3次均匀B样条曲线,插值曲线经过除首末点以外的所有控制点。在均匀参数分割下,曲线具有C2连续性,取特殊参数时可达C3连续。在参数变化过程中,曲线各段起点、终点的位置发生改变,但这些点处的一阶、二阶导矢始终保持不变,即始终与3次B样条曲线相同。曲线形状与端点条件密切相关,而B样条曲线具有良好的保形性,这些综合因素使得曲线在形状变化的过程中始终可以较好地保持控制多边形的特征。采用张量积方法将曲线推广至曲面,曲线曲面图例显示了该方法在造型设计中的有效性。     

高阶连续的形状可调三角多项式曲线曲面

目的目前使用的B样条曲线曲面存在着高连续阶与高局部调整性两者无法兼而有之的不足,且B样条曲线曲面的形状被控制顶点和节点向量唯一确定,这些因素影响着B样条方法的几何设计效果与方便性。本文旨在克服这种局限,以期构造具有高次B样条方法的高连续阶,低次B样条方法的高局部调整性,以及有理B样条方法权因子决定的形状调整性的曲线曲面。方法在三角函数空间上构造了一组含参数的调配函数,进而定义具有与3次B样条曲线曲面相同结构的新曲线与张量积曲面。结果新曲线曲面继承了B样条方法的凸包性、对称性、几何不变性等诸多性质。不同的是,同样是基于4点分段,3次均匀B样条曲线C2连续,而对于等距节点,在一般情况下,新曲线C5连续,当参数取特殊值时可达C7连续。新曲线在C5连续的情况下存在1个形状参数,能较好地调整曲线的形状同时又无须改变控制顶点。另外,将形状参数设为特定值,新曲线可以自动插值给定点列。新曲面具有与新曲线相应的优点。结论在强局部性下实现高阶连续性的形状可调分段组合曲线曲面,为高阶光滑曲线曲面的设计提供了可能,并且新曲线实现了逼近与插值的统一表示,能较好地应用于工程实际。调配函数的构造方法具有一般性,可用相同方式构造其他具有类似性质的调配函数。     

基于曲率调节的二次均匀B样条插值曲线

提出了一种二次均匀B样条插值曲线的构造方法,首先给定某一段曲线首点的相对曲率和该段曲线的首端切矢量的方向角,利用二次均匀B样条曲线的端点性质,求出其余各段曲线控制顶点,来生成整条插值曲线。该方法无需做反求运算,不仅保持了B样条曲线的优点,而且可以通过修改曲线首点的相对曲率和该段曲线的首端切矢量的方向角对曲线进行整体调节。     

基于渐进迭代逼近的矢量地图曲线化简方法

矢量地图化简在地形仿真、制图综合等研究中具有重要应用。针对已有算法难以兼顾化简曲线 的整体形态和局部特征点精度的问题,提出一种基于 B 样条曲线渐进迭代逼近(PIA)的矢量地图曲线化简方法。 首先筛选出能保持曲线轮廓、具有最大信息量的特征点列,将其作为初始控制点列,得到相应的非均匀 3 次 B 样条拟合曲线;然后根据拟合曲线与特征点的误差进行迭代调整控制点,逐步得到一系列逼近曲线,直至最终 满足精度要求。实验表明,PIA 方法不仅保持了化简曲线的整体几何形态,而且能在满足全局误差要求的情况 下,实现特征点处的高精度逼近。     

一种 G2 连续组合曲线的表示

针对 Bézier 曲线以及现有众多含形状参数的扩展 Bézier 曲线的 G2 拼接条件均对控制顶点有严 格要求的问题,拟提出一种 G2 连续组合曲线,其能综合 Bézier 与 B 样条方法的优点,其基函数具有显式表达 式,既具有 B 样条方法的自动光滑性,又能轻松拥有 Bézier 曲线的端点几何特征。为此,构造了一组含 6 个 参数的基函数,按照 3 次 Bézier 曲线的定义方式由之构造了基于 4 个控制顶点的曲线段,根据曲线段的拼接条 件,按照 3 次 B 样条曲线的定义方式构造了基于 4 点分段的组合曲线。基函数具有全正性,其同时包含 3 次 Bernstein 基函数和所有由内部节点重复度均为 1 的节点向量所确定的 3 次 B 样条基函数作为特例。曲线段具 有保凸性、端点位置以及形状可调性,其同时包含 3 次 Bézier 曲线和 3 次 B 样条曲线段作为特例。组合曲线 的定义方式自动保证了其整体 G2 连续,将部分参数取特定值,即可使其端点插值、端边相切,此时其中依然 存在用于调整内部形状的独立参数。按一定规则选取组合曲线中的参数,即可重构 C2 连续的 3 次 B 样条曲线。     

Point-tangent/point-normal B-spline curve interpolation by geometric algorithms

We introduce a novel method to interpolate a set of data points as well as unit tangent vectors or unit normal vectors at the data points by means of a B-spline curve interpolation technique using geometric algorithms. The advantages of our algorithm are that it has a compact representation, it does not require the magnitudes of the tangent vectors or normal vectors, and it has C² continuity. We compare our method with the conventional curve interpolation methods, namely, the standard point interpolation method, the method introduced by Piegl and Tiller, which interpolates points as well as the first derivatives at every point, and the piecewise cubic Hermite interpolation method. Examples are provided to demonstrate the effectiveness of the proposed algorithms.     

基于SOM网络的三次B样条曲线重建

使用散乱点集重建曲线曲面,在逆向工程和计算机视觉中有着广泛的应用。提出基于SOM网络的三次B样条曲线重建算法。给定某一曲线散乱点集和一初始神经网络,优化SOM网络中神经元位置,使网络逼近散乱点和映射散乱点空间特征。用特征点反求三次B样条曲线控制点,利用控制点重建三次B样条曲线。试验结果表明,算法取得的曲线重建效果良好。     

Approaches for constrained parametric curve interpolation

The construction of a GCx cubic interpolating curve that lies on the same side of a given straight line as the data points is studied. The main task is to choose appropriate approaches to modify tangent vectors at the data points for the desired curve. Three types of approaches for changing the magnitudes of the tangent vectors axe presented. The first-type approach modifies the tangent vectors by applying a constraint to the curve segment. The second one does the work by optimization techniques. The third one is a modification of the existing method. Three criteria are presented to compare the three types of approaches with the existing method. The experiments that test the effectiveness of the approaches are included.     

带形状参数的C~2连续类三次三角样条曲线

传统的三次均匀B样条曲线在给定控制顶点时其形状不能调整,以及不能精确表示圆锥曲线。针对三次均匀B样条曲线的不足,提出了一种带形状参数的C2连续的类三次三角样条曲线。该曲线不仅与三次均匀B样条曲线具有相似的性质,而且在控制顶点保持不变时其形状可通过形状参数的取值进行调整。在适当条件下,类三次三角样条曲线比三次均匀B样条曲线更能逼近于控制多边形,且能精确表示圆、椭圆、抛物线等圆锥曲线。     

基于误差控制的自适应3次B样条曲线插值

针对现有曲线插值算法不能有效压缩型值点的缺陷,研究了一种自适应三次B样条曲线插值算法。从型值点序列中选用最少的点插值一条初始曲线,基于提出的点到曲线的最小距离计算方法,分别计算各非插值点对应的插值误差,并从中提取最大插值误差。若最大误差大于给定的误差阈值,则将其对应的型值点加入插值型值点序列,重新插值曲线,直到最大插值误差满足误差要求。与现有曲线插值算法相比,该算法可以在保证插值精度的前提下有效压缩数据量。     

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

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

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.     

渐进迭代逼近方法在曲线变形上的应用

目的 随着几何造型、计算机动画等领域的快速发展,曲线的自由变形技术在近年来受到了广泛的关注。为了获得更多有趣、逼真的变形效果,提出基于渐进迭代逼近与主顶点方法的曲线局部变形算法。方法 给定数据点集,首先采用渐进迭代逼近方法或是基于最小二乘的渐进迭代逼近方法产生待变形曲线;其次对待变形区域使用延拓准则,基于主顶点方法与待变形曲线的形状信息选取控制顶点进行调整;最后对调整后的控制顶点运用局部渐进迭代逼近方法生成逼近曲线,得到期望的变形效果。结果 此变形操作借助于局部渐进迭代逼近方法,具有较好的灵活性。通过茶壶、面部轮廓、手等数值实例,表明了该方法可以得到良好的变形效果。进一步地,借助于叠加变形还可以得到整体的、周期的、伸缩的等各类更加丰富的变形效果。结论 本文研究渐进迭代逼近在曲线变形上的应用,将主顶点方法引入曲线的变形之中,把两者相结合提出了基于渐进迭代逼近与主顶点方法的曲线局部变形算法。该算法不仅具备渐进迭代逼近方法的收敛稳定性,且借助于主顶点方法,可以得到较好的变形效果。该方法适用于曲线的局部变形,丰富了曲线的变形效果。     

Shape Control and Modification of RationalCubic B-Spline Curves

This paper considers the construction of a rational cubic B-spline curve that willinterpolate a sequence of data points x'+ith specified tangent directions at those points. It is emphasisedthat the constraints are purely geometrical and that the pararnetric tangent magnitudes are notassigned as in many' curl'e manipulation methods. The knot vector is fixed and the unknowns are thecontrol points and x"eightsf in this respect the technique is fundamentally different from otherswhere knot insertion is allowed.First. the theoretical result3 for the uniform rational cubic B-spline are presented. Then. in theplanar case. the effect of changes to the tangent at a single point and the acceptable bounds for thechange are established so that all the weights and tangent magnitUdes remain positive. Finally, aninteractive procedure for controlling the shape of a planar rational cubic B-spline curve is presented.     

带最多独立形状参数的三阶三次均匀B样条曲线

构造了三阶三次等距结点的多项式B样条参数曲线,给出了de Boor控制顶点与分段三次Bézier控制顶点的关系式。该曲线具有一些类似于二次B样条曲线的性质：关于参变量为C¹连续,每个样条区间上的曲线由三个de Boor控制顶点的线性组合表示,具有仿射变换下的不变性,包含了二次均匀B样条曲线等。还具有形状可调性质：调配函数中含有形状参数,具有明显的几何意义,可用于调控曲线的形状或变形。给出了其具有凸包性、对de Boor控制多边形保形性等性质及其条件,讨论了形状参数对曲线形状的影响。     

Shape modeling based on specifying the initial B-spline curve and scaled BFGS optimization method

In this paper, we consider the problem of fitting the B-spline curves to a set of ordered points, by finding the control points and the location parameters. The presented method takes two main steps: specifying initial B-spline curve and optimization. The method determines the number and the position of control points such that the initial B-spline curve is very close to the target curve. The proposed method introduces a length parameter in which this allows us to adjust the number of the control points and increases the precision of the initial B-spline curve. Afterwards, the scaled BFGS algorithm is used to optimize the control points and the foot points simultaneously and generates the final curve. Furthermore, we present a new procedure to insert a new control point and repeat the optimization method, if it is necessary to modify the fitting accuracy of the generated B-spline fitting curve. Associated examples are also offered to show that the proposed approach performs accurately for complex shapes with a large number of data points and is able to generate a precise fitting curve with a high degree of approximation.     

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

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

Efficient planar object tracking and parameter estimation usingcompactly represented cubic B-spline curves

In this paper, we consider the problem of matching 2D planar object curves from a database, and tracking moving object curves through an image sequence. The first part of the paper describes a curve data compression method using B-spline curve approximation. We present a new constrained active B-spline curve model based on the minimum mean square error (MMSE) criterion, and an iterative algorithm for selecting the “best” segment border points for each B-spline curve. The second part of the paper describes a method for simultaneous object tracking and affine parameter estimation using the approximate curves and profiles. We propose a novel B-spline point assignment algorithm which incorporates the significant corners for interpolating corresponding points on the two curves to be compared. A gradient-based algorithm is presented for simultaneously tracking object curves, and estimating the associated translation, rotation and scaling parameters. The performance of each proposed method is evaluated using still images and image sequences containing simple objects     

Data reduction using cubic rational B-splines

A geometric method for fitting rational cubic B-spline curves to data representing smooth curves, such as intersection curves or silhouette lines, is presented. The algorithm relies on the convex hull and on the variation diminishing properties of Bezier/B-spline curves. It is shown that the algorithm delivers fitting curves that approximate the data with high accuracy even in cases with large tolerances. The ways in which the algorithm computes the end tangent magnitudes and inner control points, fits cubic curves through intermediate points, checks the approximate error, obtains optimal segmentation using binary search, and obtains appropriate final curve form are discussed