利用近似能量极小构造平面C1三次Hermite插值曲线

研究了利用近似能量极小构造平面$C^1$三次Hermite插值曲线的方法.该方法的主要的目是求出$C^1$三次Hermite插值曲线的最佳切矢.通过将应变能、曲率变化能和组合能的近似函数极小化,得到了求解最佳切矢的线性方程组.通过求解发现,近似曲率变化能极小不存在唯一解, 而近似应变能极小和近似组合能极小由于方程系统的系数矩阵为严格对角占优故都存在唯一解.最后, 通过实例表明了本文方法构造平面$C^1$三次Hermite插值曲线的有效性.     

分段三次保形插值法

1 引言 计算机图形学的一个基本问题就是寻找一条光滑曲线过一组型值点{x_i,y_i}(i=0,1,…n+1),解决这一问题最简单的办法是用分段三次Hermite插值,这种插值构造容易,绘图简单. 分段三次Hermite插值的关键是估计型值点处的导数,只要估计出一组导数值,就对应一个分段三次Hermite插值.但在实际应用中,必须考虑插值曲线对型值点组某些特征的继承性,如曲线的保凸性,保形性等. [1—2]研究了分段三次Hermite插值的保单调性.[3]导出了分段三次Hermite插值保形的一个充要条件,这一条件表明并非任何型值点组都存在保形插值.正因为如此,许多文献采用了不同的方法解决保形插值问题.[4—5]用分段有理三次,但计算量增加较大;[6]     

一类C~2连续且保凸的插值三次参数样条曲线的构造

本文给出在平面上插值点列为凸的时,构造一类 C~2连续且保凸的插值三次参数样条曲线的方法.这里通过选择插值节点 P_i 处插值曲线 p(t)的切矢方向和长度来代替以往常用的参变量,从而得到一类新的方法.     

参数保形插值中决定切矢的方法

由分段三次参数多项式曲线拼合成的Ｃ１插值曲线的形状与数据点处的切矢有很大关系．基于对保形插值曲线特点的分析，本文提出了估计数据点处切矢的一种方法：采用使构造的插值曲线的长度尽可能短的思想估计数据点处的切矢，并且通过四组有代表性的数据对本方法和已有的三种方法进行了比较．     

基于五次Hermite插值的机械臂最短路径规划研究

为了保证机械臂高效率和平稳的运行,机械臂运动轨迹曲线一般需要具有C~2连续性,且运动路径具有最优性.采用五次Hermite插值函数方法,构造机械臂的运动轨迹.求解最优化问题得到连接点处二阶导数信息,构造满足上述条件的曲线轨迹,最后给出了两个实例来验证该方法的有效性.     

具有承袭性的高阶导数有理插值算法

切触有理插值是函数逼近的一个重要内容,而降低切触有理插值的次数和解决切触有理插值函数的存在性是有理插值的一个重要问题.切触有理插值函数的算法大都是基于连分式进行的,其算法可行性是有条件的,且计算量较大.利用Newton(牛顿)多项式插值的承袭性和分段组合的方法,构造出了一种无极点且满足高阶导数插值条件的切触有理插值函数,并推广到向量值切触有理插值情形;既解决了切触有理插值函数存在性问题,又降低了切触有理插值函数的次数.最后给出误差估计,并通过数值实例说明该算法具有承袭性、计算量低、便于编程等特点.     

基于面积约束的统计直方图曲线拟合

我们提出用分段三次Hermite插值曲线拟合统计直方图的新方法.先根据统计直方图的特点选取Hermite插值曲线在插值点处的导数值和可调整的插值点,然后根据面积约束确定调整值,从而得到拟合曲线.所得拟合曲线与统计直方图有面积相等的约束,并且拟合曲线是C1连续的光滑曲线.所给方法简单、实用.     

G^2有理三次GHI插值算法

本文研究 GHI插值 ,对于给定的切矢和曲率 ,导出了一条分段三次有理 Bézier插值曲线 .该曲线的所有 Bézier点和权因子由已知曲率和切矢直接计算生成 ,最后给出了一个数值实例     

分段低次插值多项式序列的一致收敛性

利用分段线性与三次Hermite插值基函数以及连续模概念,分别推导出分段线性与三次Hermite插值多项式序列一致收敛于被插函数.     

一类带参数的有理三次三角Hermite插值样条

给出一种带有参数的有理三次三角Hermite插值样条,具有标准三次Hermite插值样条相似的性质.利用参数的不同取值不但可以调控插值曲线的形状,而且比标准三次Hermite插值样条更好地逼近被插曲线.此外,选择合适的控制点,该种插值样条可以精确表示星形线和四叶玫瑰线等超越曲线.     

Discussion on relationship between minimal energy and curve shapes

Energy minimization has been widely used for constructing curve and surface in the fields such as computer-aided geometric design, computer graphics. However, our testing examples show that energy minimization does not optimize the shape of the curve sometimes. This paper studies the relationship between minimizing strain energy and curve shapes, the study is carried out by constructing a cubic Hermite curve with satisfactory shape. The cubic Hermite curve interpolates the positions and tangent vectors of two given endpoints. Computer simulation technique has become one of the methods of scientific discovery, the study process is carried out by numerical computation and computer simulation technique. Our result shows that： （1） cubic Hermite curves cannot be constructed by solely minimizing the strain energy; （2） by adoption of a local minimum value of the strain energy, the shapes of cubic Hermite curves could be determined for about 60 percent of all cases, some of which have unsatisfactory shapes, however. Based on strain energy model and analysis, a new model is presented for constructing cubic Hermite curves with satisfactory shapes, which is a modification of strain energy model. The new model uses an explicit formula to compute the magnitudes of the two tangent vectors, and has the properties： （1） it is easy to compute; （2） it makes the cubic Hermite curves have satisfactory shapes while holding the good property of minimizing strain energy for some cases in curve construction. The comparison of the new model with the minimum strain energy model is included.     

Curvature variation minimizing cubic Hermite interpolants

In this paper, planar parametric Hermite cubic interpolants with small curvature variation are studied. By minimization of an appropriate approximate functional, it is shown that a unique solution of the interpolation problem exists, and has a nice geometric interpretation. The best solution of such a problem is a quadratic geometric interpolant. The optimal approximation order 4 of the solution is confirmed. The approach is combined with strain energy minimization in order to obtain G¹ cubic interpolatory spline.     

Shape-Preserving Local Interpolation for Plotting Solutions of ODEs

We investigate the use of piecewise rational interpolants ofDelbourgo and Gregory in an important and widely occurring application.We propose the following algorithm for visually pleasing plotsof the solution of an ordinary differential equation (ODE):use piecewise cubic Hermite interpolation where it can be shownto preserve shape (monotonicity and/or convexity) and also wherethere is no shape to preserve, otherwise use the appropriateconvex or monotone piecewise rational interpolant. Bounds arederived which enable efficient plotting of the rational interpolants.This scheme should be useful in any context where both solutionand derivative of a function are available as data.     

Planar G2 Hermite interpolation with some fair,C-shaped curves

G² Hermite data consists of two points, two unit tangent vectors at those points, and two signed curvatures at those points. The planar G² Hermite interpolation problem is to find a planar curve matching planar G² Hermite data. In this paper, a C-shaped interpolating curve made of one or two spirals is sought. Such a curve is considered fair because it comprises a small number of spirals. The C-shaped curve used here is made by joining a circular arc and a conic in a G² manner. A curve of this type that matches given G² Hermite data can be found by solving a quadratic equation. The new curve is compared to the cubic Bézier curve and to a curve made from a G² join of a pair of quadratics. The new curve covers a much larger range of the G² Hermite data that can be matched by a C-shaped curve of one or two spirals than those curves cover.     

参数五次GC^2 Hermite插值

本文研究几何Ｈｅｒｍｉｔｅ插值问题,对于给定的切矢和曲率,导出了一条分段五次Ｂｅｚｉｅｒ插值曲线。该曲线的所有Ｂｅｚｉｅｒ点由已知的曲率、切矢和型值点直接计算生成,曲线是ＧＣ＾２连续的和局部的。最后,给出了一个数值实例。     

关于建立玉米叶片的数学模型的几种方法的讨论

分别运用拉格朗日插值法、最小二乘的三次多项式拟合法和经典三次样条插值法建立了玉米叶片的数学模型,并从收敛性、稳定性、光滑性等方面对三种方法进行了对比分析,通过对所给实例的绘图效果进行比较,指出了拉格朗日插值法、最小二乘的三次多项式拟合法和经典三次样条插值法在描述玉米叶片形态特征的效能上的利弊.     

球面上的几何连续插值

In this paper, a new method for geometrically continuous interpolation in spheres is proposed. The method is entirely based on the spherical B′ezier curves defined by the generalized de Casteljau algorithm. Firstly we compute the tangent directions and curvature vectors at the endpoints of a spherical B′ezier curve. Then, based on the above results, we design a piecewise spherical B′ezier curve with G 1 and G 2 continuity. In order to get the optimal piecewise curve according to two different criteria, we also give a constructive method to determine the shape parameters of the curve. According to the method, any given spherical points can be directly interpolated in the sphere. Experimental results also demonstrate that the method performs well both in uniform speed and magnitude of covariant acceleration.     

An energy-minimization framework for monotonic cubic spline interpolation

This paper describes the use of cubic splines for interpolating monotonic data sets. Interpolating cubic splines are popular for fitting data because they use low-order polynomials and have C² continuity, a property that permits them to satisfy a desirable smoothness constraint. Unfortunately, that same constraint often violates another desirable property: monotonicity. It is possible for a set of monotonically increasing (or decreasing) data points to yield a curve that is not monotonic, i.e., the spline may oscillate. In such cases, it is necessary to sacrifice some smoothness in order to preserve monotonicity.The goal of this work is to determine the smoothest possible curve that passes through its control points while simultaneously satisfying the monotonicity constraint. We first describe a set of conditions that form the basis of the monotonic cubic spline interpolation algorithm presented in this paper. The conditions are simplified and consolidated to yield a fast method for determining monotonicity. This result is applied within an energy minimization framework to yield linear and nonlinear optimization-based methods. We consider various energy measures for the optimization objective functions. Comparisons among the different techniques are given, and superior monotonic C² cubic spline interpolation results are presented. Extensions to shape preserving splines and data smoothing are described.