用边界曲线构造C~1 Coons曲面确定扭矢的方法

本文讨论了由四条边界曲线构造Ｃ１Ｃｏｏｎｓ曲面的问题，给出了确定角点扭矢的新方法．该方法沿四边形两对角线方向构造两条四次多项式曲线，每个角点处的扭矢，由一条四次曲线和两条边界曲线确定．跨界切矢由三次埃尔米特插值方法定义．文中还给出了一个用新方法构造曲面的实例．     

用边界曲线构造C^1Coons曲面确定扭矢的方法

本文讨论了由四条边界曲线构造C^1Coons曲面的问题，给出了确定角点扭矢的新方法．该方法沿四边形两对角线方向构造两条四次多项式曲线，每个角点处的扭矢，由一条四次曲线和两条边界曲线确定．跨界切矢由三次埃尔米特插值方法定义．文中还给出了一个用新方法构造曲面的实例．     

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

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

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

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

导数振荡与应变能极小的平面分段三次参数Hermite插值

由于分段三次参数Hermite插值的切矢往往被作为变量,故可对其进行优化以使得构造的插值曲线满足特定的要求.为了构造兼具保形性与光顺性的平面分段三次参数Hermite插值曲线,给出了一种通过同时极小化导数振荡和应变能来确定切矢的方法.首先以导数振荡函数和应变能函数为双目标建立了切矢满足的方程系统;然后证明了方程系统存在唯一解,并给出了解的具体表达式;最后给出了误差分析,并通过数值算例表明方法的有效性.结果表明,相对于导数振荡极小化方法和应变能极小化方法,所提出的导数振荡和应变能极小化方法同时兼顾了平面分段三次参数Hermite插值曲线的保形性和光顺性.     

参数五次GC^2 Hermite插值

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

广义Bézier曲线的形状修改

根据广义Bézier曲线的性质,提出了通过调整参数α,β和端点的目标导矢D0,Dn及端点目标二阶导矢E0,En的方法,使曲线插值目标点和在端点具有已给切矢或二阶导矢.这种方法对于曲线的交互设计以及过渡曲线的设计具有重要的意义.     

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

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

加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

分段三次保形插值法

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

一种二次保形插值参数曲面

1．引言保形插值是工业设计和制造中经常遇到的问题，有关这方面的研究已有许多文献【‘－u1．设n二Fx；，yi，人，川7一0，1，…；n；j＝0；l，…，。；x；＜x；＋1．l＝0，1，…．n—1；yi＜的十；，J二O，L…，。一卫｝是一给定的数据集，Cadson和［ltsch、Beatson和zejerJ－1985年分别提出的方法只保持被插数据集的轴向单调性；Dodd和Roulier等人于1983和1987年提出的方法只保持被插点集网格线上的轴向凸凹性和单调性；Constantini和FOntanella于1990年提出的方法可保持被插点集在所有于区域的边界及共内部的轴向凸凹性和单调性；…     

A sinusoidal polynomial spline and its Bezier blended interpolant

Functional polynomials composed of sinusoidal functions are introduced as basis functions to construct an interpolatory spline. An interpolant constructed in this way does not require solving a system of linear equations as many approaches do. However there are vanishing tangent vectors at the interpolating points. By blending with a Bezier curve using the data points as the control points, the blended curve is a proper smooth interpolant. The blending factor has the effect similar to the “tension” control of tension splines. Piecewise interpolants can be constructed in an analogous way as a connection of Bezier curve segments to achieve C¹ continuity at the connecting points. Smooth interpolating surface patches can also be defined by blending sinusoidal polynomial tensor surfaces and Bezier tensor surfaces. The interpolant can very efficiently be evaluated by tabulating the sinusoidal function.     

Interpolation Scheme for Planar Cubic <Emphasis Type="Italic">G</Emphasis><Superscript>2</Superscript> Spline Curves

In this paper a method for interpolating planar data points by cubic G ² splines is presented. A spline is composed of polynomial segments that interpolate two data points, tangent directions and curvatures at these points. Necessary and sufficient, purely geometric conditions for the existence of such a polynomial interpolant are derived. The obtained results are extended to the case when the derivative directions and curvatures are not prescribed as data, but are obtained by some local approximation or implied by shape requirements. As a result, the G ² spline is constructed entirely locally.     

基于离散点和法矢的曲线重构算法

This paper presents a curve reconstruction algorithm based on discrete data points and normal vectors using B-splines.The proposed algorithm has been improved in three steps:parameterization of the discrete data points with tangent vectors,the B-spline knot vector determination by the selected dominant points based on normal vectors,and the determination of the weight to balancing the two errors of the data points and normal vectors in fitting model.Therefore,we transform the B-spline fitting problem into three sub-problems,and can obtain the B-spline curve adaptively.Compared with the usual fitting method which is based on dominant points selected only by data points,the B-spline curves reconstructed by our approach can retain better geometric shape of the original curves when the given data set contains high strength noises.     

Shape-Preserving C 2 Functional Interpolation via Parametric Cubics

The paper proposes a method for the construction of a shape preserving C ² function interpolating a given set of data. The constructed interpolant is a parametric cubic curve. The shape of the curve can be easily controlled via tension parameters which have an immediate geometric interpretation. The approximation order is investigated and numerical examples are presented.     

On Shape Preserving C2 Hermite Interpolation

We propose a general parametric local approach for functional C ² Hermite shape preserving interpolation. The constructed interpolant is a parametric curve which interpolate values, first and second derivatives of a given function and reproduces the behavior of the data. The method is detailed for parametric curves with piecewise cubic components. For the selected space necessary and sufficient conditions are derived to ensure the convexity of the constructed interpolant. Monotonicity is also studied. The approximation order is investigated for both cases. The use of a parametric curves to interpolate data from a function can be considered a disadvantage of the scheme. However, the simple structure of the used curve greatly reduces such a disadvantage.     

Shape Preserving Interpolation to Convex Data

1.IntroductionA fundamental problem in computer graphics is the drawing of a smooth curve through aset of data points(xi,fi) (i=0 ,1 ,… ,n) .In many applications,particularly in scientificvisualisation,the y- values are depenenton the x- values and it is…     

带有给定凸切线多边形的保形五次样条逼近

本讨论带有给定切线多边形的保形逼近问题．给出了一条与给定切线多边形相切的保形五次参数祥条曲线。     

C1 monotone cubic Hermite interpolant

Constraining an interpolation to be shape preserving is a well established technique for modelling scientific data. Many techniques express the constraint variables in terms of abstract quantities that are difficult to relate to either physical values or the geometric properties of the interpolant. In this paper, we construct a piecewise monotonic interpolant where the degrees of freedom are expressed in terms of the weights of the rational Bézier cubic interpolant.