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.     

Smooth surface approximation to serial cross-sections

The reconstruction of the surface model of an object from 2D cross-sections plays an important role in many applications. In this paper, we present a method for surface approximation to a given set of 2D contours. The resulting surface is represented by a bicubic closed B-spline surface with C² continuity. The method performs the skinning of intermediate contour curves represented by cubic B-spline curves on a common knot vector, each of which is fitted to its contour points within a given accuracy. In order to acquire more compact representation for the surface, the method includes an algorithm for reducing the number of knots in the common knot vector. The proposed method provides a smooth and accurate surface model, yet realizes efficient data reduction. Some experimental results are given using synthetic and MRI data.     

Approximate T-spline surface skinning

This paper considers the problem of constructing a smooth surface to fit rows of data points. A special class of $T$-spline surfaces is examined, which is characterized to have a global knot vector in one parameter direction and individual knot vectors from row to row in the other parameter direction. These $T$-spline surfaces are suitable for lofted surface interpolation or approximation. A skinning algorithm using these $T$-spline surfaces is proposed, which does not require the knot compatibility of sectional curves. The algorithm consists of three main steps: generating sectional curves by interpolating data points of each row by a $B$-spline curve; computing the control curves of a skinning surface that interpolates the sectional curves; and approximating each control curve by a $B$-spline curve with fewer knots, which results in a $T$-spline surface. Compared with conventional $B$-spline surface skinning, the proposed $T$-spline surface skinning has two advantages. First, the sectional curves and the control curves of a $T$-spline surface can be constructed independently. Second, the generated $T$-spline skinning surface usually has much fewer control points than a lofted $B$-spline surface that fits the data points with the same error bound. Experimental examples have demonstrated the effectiveness of the proposed algorithm.     

B样条曲面的双向插值造型算法

基于Coons-Gordon造型原理,研究了插值两族相交截面线采样点的B样条曲面双向插值造型算法。参数化各采样点并计算每条截面线的节点矢量,估算每条截面线对应的曲面参数,根据每条截面线的节点分布以及另一族截面线对应的曲面参数统一节点矢量。分别插值两族截面线采样点及其公共点得到三张B样条曲面,其布尔和即为插值两族截面线采样点的B样条插值曲面。实例表明,得到的双向插值曲面控制顶点数少,光顺性好。     

基于截面数据的C1插值融合曲面重建

为了避免NURBS曲面重建需要进行节点矢量相容的问题，提出了一种双方向融合插值的[C1]参数曲面重建方法，该方法先后分段插值截面上连续的数据点、截面曲线以构造样条曲线和曲面片，并引入融合算法进行曲线、曲面拼接，从而得到光滑的待建曲面。该方法不会产生由节点插入所带来的大量的数据冗余以及复杂的计算过程，同时采用了融合的思想来处理曲线、曲面的拼接，改良了传统参数曲线、曲面拼接方法需要满足边界条件的缺陷。     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

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.     

五阶与六阶三角样条曲线

利用三角函数构造了两个含参数的函数组,它们分别由6 个、7 个函数组 成,分析了这两个函数组的性质。由这两组函数定义了两种新的样条曲线,它们分别具有与 五次、六次B 样条曲线相同的结构。新曲线在继承B 样条曲线基本性质的同时,又具备了 一些新的优点。例如,在等距节点下,新曲线在节点处均可以达到C5 连续,而且在不改变 控制顶点的情况下,新曲线的形状均可以通过改变形状参数的值进行调整。另外,给出了使 新曲线插值于控制多边形首末端点的方法,以及构造闭曲线的方法等,文中的图例说明了新 方法的正确性和可行性。     

一种B样条表面插值控制点的缩减方法

研究了从给定节点向量中选择节点进行B样条曲线插值的方法，并将此方法应用到行数据点不相同的B样条曲面插值，得到了一个通过对行节点矢量调整传递的曲面插值方法，理论分析和实验表明该方法可大量减少曲面控制点的数目．     

Curve interpolation in recursively generated B-spline surfaces over arbitrary topology

Recursive subdivision is receiving a great deal of attention in the definition of B-spline surfaces over arbitrary topology. The technique has recently been extended to generate interpolating surfaces with given normal vectors at the interpolated vertices. This paper describes an algorithm to generate recursive subdivision surfaces that interpolate B-spline curves. The control polygon of each curve is defined by a path of vertices of the polyhedral network describing the surface. The method consists of applying a one-step subdivision of the initial network and modifying the topology in the neighborhood of the vertices generated from the control polygons. Subsequent subdivisions of the modified network generate sequences of polygons each of which converges to a curve interpolated by the limit surface. In the case of regular networks, the method can be reduced to a knot insertion process.     

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

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

G2 quasi-developable Bezier surface interpolation of two space curves

Surface development is used in many manufacturing planning operations, e.g., for garments, ships and automobiles. However, most freeform surfaces used in design are not developable, and therefore the developed patterns are not isometric to the original design surface. In some domains, the CAD model is created by interpolating two given space curves. In this paper, we propose a method to obtain a G² quasi-developable Bezier surface interpolating two arbitrary space curves. The given curves are first split into a number of piecewise Bezier curves and elemental Bezier patches each of which passes through four splitting points are constructed. All neighboring elemental patches are G² connected and they are assembled optimally in terms of the degree of developability (the integral Gaussian curvature). Experiments show that the final composite Bezier surface is superior to a lofted one which is defined regardless of the final surface developability.     

Reducing control points in surface interpolation

Surface interpolation to rectangularly arranged points is an integral part of surface design and modeling in CAD/CAM and graphics. Using B-spline surfaces, the process involves curve interpolations through rows of data points and through columns of control points. This method, as well tuned as it is, proves inadequate for recent problems such as those of reverse engineering. Data acquisition devices, such as scanners, may be used to return rows of data points, but it's not guaranteed that each row contains the same number of points. The problem then arises of passing a smooth surface through these points (assuming that interpolation is justified, meaning the number of points isn't large). Since each row contains different numbers of points, regular data interpolation can't be used. One method to solve this problem is to interpolate each row with B-spline curves and to pass a smooth surface through these curves via surface skinning. While this is a legitimate solution, the number of control points tends to become prohibitively large, especially if the number of rows is large. This article addresses the problem of how to reduce the number of control points while maintaining precise interpolation. The idea is to give the knots some flexibility so that each row can be interpolated with as few new knots added as possible     

Surface construction by fitting unorganized curves

We present a novel technique to construct a B-spline surface from unorganized curves in 3D space. Unlike the lofting or skinning methods, where the family of curves to be lofted form isoparametric lines of the resulting surface, our method relaxes this restriction and allows a set of curves to take arbitrary orientation and possibly intersect each other. We employ the concept of a curve on a surface which is used in obtaining the arc element of a curve on the surface in differential geometry. This novel technique is useful in surface construction or creation where surfaces are created based on sketches. The surface creation has applications in aesthetic shape design, reverse engineering, computer graphics, and computer animation. This technique is also useful in surface reconstruction where surfaces are constructed from stripes which are made of a series of points lined up in a sequential manner.     

满足数据点切向约束的二次B样条插值曲线

给出一种二次B样条曲线插值方法.利用数据点的参数化和节点向量的自由度,构造在各数据点满足切向约束的二次B样条插值曲线,直观地控制插值曲线达到预期形状.用文中方法构造插值曲线是一个递推过程,不必预先确定数据点参数值和节点向量、不必解线性方程组,而是在插值过程中根据数据点及其切向的约束条件递推地确定数据点的参数值、节点和控制顶点.该文方法允许插值曲线各段的连接点与数据点不一致,以使得二次B样条插值曲线的形状更自然.而且在满足数据点切向约束的条件下,还可利用节点进一步调控插值曲线的形状.另外,用文中方法构造的二次B样条插值曲线对于数据点的改变具有较好的局部性质.文中最后给出一些例子将该文方法与其它一些插值方法进行比较,实验结果表明,该文方法是有效的.     

基于最佳平方逼近的B样条曲线降阶

提出了一种基于带约束的最佳平方逼近的B样条曲线降阶的方法.首先讨论了降阶后曲线控制顶点个数以及节点向量的取法、保端点的B样条曲线降阶方法,并把带约束的最佳平方逼近技术引入到B样条曲线的降阶,即误差大的区域施加较大的权函数以降低最大误差.为满足给定误差限制下的降阶,提出了对原曲线插入节点的准则,即对不满足误差限制的区域插入节点.并用实例对新方法和基于扰动约束技术的降阶方法进行了比较.     

Constructing iterative non-uniform B-spline curve and surface to fit data points

In this paper, based on the idea of profit and loss modification, we presentthe iterative non-uniform B-spline curve and surface to settle a key problem in computeraided geometric design and reverse engineering, that is, constructing the curve (surface)fitting (interpolating) a given ordered point set without solving a linear system. We startwith a piece of initial non-uniform B-spline curve (surface) which takes the given point setas its control point set. Then by adjusting its control points gradually with iterative formula,we can get a group of non-uniform B-spline curves (surfaces) with gradually higherprecision. In this paper, using modern matrix theory, we strictly prove that the limit curve(surface) of the iteration interpolates the given point set. The non-uniform B-spline curves(surfaces) generated with the iteration have many advantages, such as satisfying theNURBS standard, having explicit expression, gaining locality, and convexity preserving,etc     

Nonuniform B-spline Mesh Fairing Method

A method for fairing a surface composed of a set of discrete data points distributed in anonrectangular topological mesh is presented.All curves are expressed by nonuniform cubic B-splinecurves.The fairing method is minimizing the elastic strain energy of mesh curves and of springs at-tached to the data points.The fairing surface can be generated by interpolating through the meshcurves.The generation and fairing of a ship hull surface is given as an example.     

基于曲率优化的机器人砂带磨削轨迹规划

针对复杂曲面零件砂带磨削编程效率低、精度差的问题,基于B样条曲线曲面重构和机器人离线编程技术,提出了一种根据关键接触点曲率值生成工业机器人磨削轨迹的方法.首先,利用零件表面上需要进行砂带磨削的关键接触点和积累弦长参数化法构造节点矢量,从而计算出磨削轨迹的B样条基函数;其次,根据控制顶点反求矩阵得到全部未知控制点和3次B样条加工曲线;然后,分析关键接触点之间的曲率变化率和弧长,对关键点细化生成符合磨削工艺要求的目标点;最后,通过求解双3次B样条插值曲面方程获得目标点的加工姿态.以水龙头磨削为例进行试验,结果表明曲率优化算法磨削的零件表面轮廓形状明显优于截面法,且其粗糙度值能稳定在0.082 μm左右,可以有效提高工件表面加工质量.     

Constrained shape modification of cubic B-spline curves by means of knots

The effect of the modification of knot values on the shape of B-spline curves is examined in this paper. The modification of a knot of a B-spline curve of order k generates a one-parameter family of curves.This family has an envelope which is also a B-spline curve with the same control polygon and of order k−1. Applying this theoretical result, three shape control methods are provided for cubic B-spline curves, that are based on the modification of three consecutive knots. The proposed methods enable local shape modifications subject to position and/or tangent constraints that can be specified within well defined limits.