一种G^2连续的二交一样条插值方法

给出了一种用二次曲线段来插值平面有序数据点列的一种方法,文中的曲线采用隐函数表示面不是常用的参数形式。曲线不是用通常的二曲线方程来表示,而且用一种带参数的函数样条来表示。首先给出了用二次曲线来插值两点,两切线以及在一端点处的曲率达到给定值,其次,给出了用二次曲线样条插值平面上一个有序点列且使曲线达到整体Ｇ＾２连续,最后就用二次曲线对平面闭曲线插值问题进行了研究,该方法对数据点列没有任何限定性要求,     

基于代数曲线段的G2连续的曲线造型方法

文中提出了一种用低次代数样条曲线来插值平面上有序数据点列或者构造用多种方法表示的两曲线段间过渡曲线的一种方法 .这里得到的曲线不是用通常的代数曲线方程来表示 ,而是用一种带参数的代数方程来表示 .首先给出了用二次曲线来插值两点、两切线和用四次代数曲线插值两点、两切线和两曲率的方法 ;其次 ,给出了利用四次代数样条曲线来插值平面上一个有序点列 ,无论是构造闭曲线还是开曲线 ,都能达到整体 G2 连续 .最后 ,讨论了代数曲线 /代数曲线、代数曲线 /参数曲线以及参数曲线 /参数曲线之间的过渡曲线造型方法     

基于代数曲线段G^2连续的曲线造型方法

文中提出了一种用低次代数条来插值平面上有序数据点列或者构造用多种方法表示的两曲线段间过渡曲线的一种方法,这里得到的曲线不是用通常的代数曲线方程来表示,而是用一种带参数的代数方程来表示,首先给出了用二次曲线来插值两点、两革一和用四欠代数曲线插值两点、两切线和两曲率的方法,其次,给出了利用四次代数样条曲线来插值平面上一个有序点列,无论是构造闭还是开曲线,都能达到整体Ｇ＾２连续最后,讨论了代数曲线／代数     

曲率连续的有理二次样条插值的一种优化方法

人们通常用有理三次曲线样条来构造整体曲率连续的曲线.提出利用有理二次样条曲线插值整体曲率连续的曲线的一种方法.首先导出了两相邻二次曲线段间曲率连续的拼接条件,然后提出了求解平面上一个闭的点列中每一点处的切线的最优算法.最后给出了闭曲线插值的一些实例以检验方法的有效性.     

可展曲面上G^2连续的曲线插值方法

根据微分几何理论,给出一种可展曲面上G2连续的曲线插值算法.构造一等距对应将可展曲面展成平面,从而将原问题转化为通常的平面上的曲线插值问题.在R2上利用二次三角B样条曲线插值型值点列,无需反算控制顶点,证明了所得的可展曲面上的插值曲线是G2连续的.理论推导和实例均表明,该算法具有推广应用的广阔前景.     

三维数据点列的拟圆柱螺线样条插值

提出了用拟圆柱螺线来插值三维空间有序数据点列的一种方法,该方法对数据点列没有任何限定性要求,分两步求解,先求空间曲线在固定平面上的投影曲线,再求整体空间曲线,无论是闭曲线还是开曲线,都有达到整体Ｇ＾１连续。     

带形状参数的三次三角Hermite插值样条曲线

给出了一种带形状参数的三次三角Hermite插值样条曲线,具有标准三次Hermite插值样条曲线完全相同的性质。给定插值条件时,样条曲线的形状可通过改变形状参数的取值进行调控。在适当条件下,该样条曲线对应的Ferguson曲线可精确表示椭圆、抛物线等工程曲线。通过选择合适的形状参数,该插值样条曲线能达到[C2]连续,而且其整体逼近效果要好于标准三次Hermite插值样条曲线。     

有理三次样条的误差分析及空间闭曲线插值

给出了具有线性分母的有理三次样条函数的误差估计,并在柱面坐标系下对一类空间闭曲线的插值问题进行了研究;通过将柱面展开,把空间闭曲线的插值问题转化为平面中的插值问题,利用具有线性分母的有理三次样条函数进行插值;最终得到的空间曲线能达到曲率连续.对该方法的误差进行了分析,数值例子显示插值效果较好.     

三次Catmull-Rom样条保广义凸插值的充要条件

对于任意给定的有序点列,利用三次Catmull-Rom样条基函数构造通过该点列的曲线,导出三次Catmull-Rom样条曲线保凸插值的充要条件;进而利用广义凸的概念,导出三次Catmull-Rom样条参数曲线保广义凸插值的充要条件.当所给点列满足保广义凸插值的充要条件时,三次Catmull-Rom样条参数曲线是自动保广义凸的且是1G连续的.采用自行构造的实例佐证了方法的有效性和理论的正确性.     

基于能量优化G2连续插值三次样条曲线

给出了一种在能量优化意义下构造G2连续保形插值三次参数样条曲线的方法.具体步骤如下:(1)以曲线应变能最小为目标构造目标函数,通过解线性方程组,求出优化意义下的每个插值点处的最优切矢方向;(2)用文中给出的简易公式求出各插值点的曲率,进而计算出插值点处的切矢模长,使曲线满足G2连续、保形插值的条件;(3)用Hermite插值方法求出相邻两插值点间的曲线.实验结果显示了方法的有效性.     

Curve fitting and fairing using conic splines

We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent continuous conic spline by interpolating the points with a quadratic Bézier spline curve or fitting the data with a smooth arc spline. The arc spline can be represented as a piecewise quadratic rational Bézier spline curve. For parts of the G¹ conic spline without an inflection, we can obtain a curvature continuous conic spline by adjusting the tangent direction at the joint point and scaling the weights for every two adjacent rational Bézier curves. The unwanted curvature extrema within conic segments or at some joint points can be removed efficiently by scaling the weights of the conic segments or moving the joint points along the normal direction of the curve at the point. In the end, a fair conic spline curve is obtained that is G² continuous at convex or concave parts and G¹ continuous at inflection points. The main advantages of the method lies in two aspects, one advantage is that we can construct a curvature continuous conic spline by a local algorithm, the other one is that the curvature plot of the conic spline can be controlled efficiently. The method can be used in the field where fair shape is desired by interpolating or approximating a given point set. Numerical examples from simulated and real data are presented to show the efficiency of the new method.     

Automatic G arc spline interpolation for closed point set

A method for generating an interpolation closed G¹ arc spline on a given closed point set is presented. For the odd case, i.e. when the number of the given points is odd, this paper disproves the traditional opinion that there is only one closed G¹ arc spline interpolating the given points. In fact, the number of the resultant closed G¹ arc splines fulfilling the interpolation condition for the odd case is exactly two. We provide an evaluation method based on the arc length as well such that the choice between those two arc splines is made automatically. For the even case, i.e. when the number of the given points is even, the points are automatically moved based on weight functions such that the interpolation condition for generating closed G¹ arc splines is satisfied, and that the adjustment is small. And then, the G¹ arc spline is constructed such that the radii of the arcs in the spline are close to each other. Examples are given to illustrate the method.     

Curve Interpolation with Arbitrary End Derivatives

An algorithm for interpolating data points with end derivative constraints is presented. The interpolating curve passes through the given points and at the same time assumes the derivatives specified. For degree p interpolation, up to p−1 derivatives may be specified, resulting in C ^p−1 continuous curve interpolants. The method is useful to piece individual curve segments together or to create closed curves with various degrees of smoothness.     

五阶与六阶三角样条曲线

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

基于草图交互的个性化服装生成方法

以建立和交互修改三维服装草图为设计手段,提出在三维人体模型上生成三维个性化服装的参数化造型方法．服装草图由2种基本几何元素组成：体现人体围度信息的封闭样条曲线和体现人体在高度方向上曲面形状过渡的不封闭样条曲线．将服装草图约束分为2类4种：一类是体现服装宽松程度的人体与服装曲面之间的间隙约束;另一类是服装几何元素本身之间的共点、共面与对称约束．从人体的特征点出发,通过间隙约束生成服装草图的几何元素;在共点、对称和共面约束下,由服装草图几何元素建立拓扑结构为四边网格的服装草图．服装草图的交互修改是草图约束维护的过程,构建侧视图、正视图、断面图3个视图组成草图修改平台,在平台上交互编辑特征曲线．服装曲面则以三维草图为框架,通过对四边网格双线性Coons曲面插值生成．提供的设计方法使服装的造型变得简洁、灵活．     

基于径向基函数与B样条的散乱数据拟合方法

针对散乱数据的曲面拟合问题,提出一种径向基函数与B样条插值结合使用的曲面拟合方法.通过分片径向基函数插值,三维散乱点,再从分片插值曲面上获取预先设定好的有序网格点的值,最后利用张量积B样条插值有序网格点,从而得到拟合曲面.该方法较好地解决散乱数据插值和拟合的计算不稳定性问题,最后给出算法实例.     

C~2-(C~3-) Continuous Interpolation Spline Curve and Surface

Free-formed or sculptured surfaces in engineering products are frequently constructed from a set of measured 3D data points.C^2-(C^3-)continuity approach is important in this field.This paper presents a method of rectangular interpolation of given 3D data array which is regularly arranged.The interpolation surface which is constructed by tensor product has dsirable properties(second-order or third-order continuity,locality)and is implemented and adjusted easily,Higher order continuity methods are also briefly discussed.