摘要
文中描述了任意三角域上插值逼近的两种方法,一种是布尔和插值,一种是凸组合插值,其特点是结构简单,易于计算。文中证明了三角网格区域上的整个插值曲面是c^1连续的,并指出离散化的插值曲面函数是空间散乱数据的一种光滑插值算法。
In this paper two interpolating approximation schemes in arbitrary triang-les are described: one is Boolean sum, the other is convex combination.These interpolated surfaces are simple to construct and easy to calculate. It isshown that the whole interpolated surface in trianglular domain is C continuousFinally, it is pointed out that the discretization interpolating surface is aC^1 interpolating surface for scattered 3D data.
出处
《国防科技大学学报》
EI
CAS
CSCD
北大核心
1989年第2期11-18,共8页
Journal of National University of Defense Technology
关键词
计算数学
插值
几何
计算
geomtry, computing, interpolation
Boolean sum, convex combination, discretization