C^3连续的保形插值三角样本曲线

本给出了构造保形插值曲线的三角样条方法，即在每两个型值点之间构造两段三次参数三角样条曲线。所构造的插值曲线是局部的，保形的和C^3连续的而且曲线的形状可由参数调节。     

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.     

带缺失数据的偏正态众数回归模型的参数估计

针对现实生活中大量数据存在偏斜的情况,构建偏正态数据下的众数回归模型.又加之数据的缺失常有发生,采用插补方法处理缺失数据集,为比较插补效果,考虑对响应变量随机缺失情形进行统计推断研究.利用高斯牛顿迭代法给出众数回归模型参数的极大似然估计,比较该模型在均值插补,回归插补,众数插补三种插补条件下的插补效果.随机模拟和实例分...     

Bézier曲线降多阶逼近的一种方法

文献[1,2]讨论了Bezier曲线一次降多阶逼近问题,得到了很好的结果.文献[1]利用广义逆矩阵得到不保端点插值的降多阶逼近曲线的控制顶点的表达式.但却没有得到带端点任意阶插值条件的降多阶逼近曲线的控制顶点的表达式.文献[2]得到了带端点任意阶插值的降多阶逼近曲线的控制顶点的解析表达式.本文首先给出两Bezier曲线间距离的定义;然后根据降阶曲线与原曲线间的距离最小,分别得到了用矩阵表示的不保端点插值和保端点任意阶插值的降多阶逼近曲线的控制顶点的显示表达式.所给数值例子显示,用本文方法得到的降多阶逼近曲线对原曲线有很好的逼近效果.     

奇异谱迭代插补的改进算法及其在缺损数据恢复中的应用

基于奇异谱分析（SSA）迭代插补的基本思想,针对该方法在参数确定（主成分个数K和嵌入维数M)上存在较大随意性和计算效率低等缺陷,提出了一种参数优化的新算法——区间四分法,该方法在误差曲线存在局部波动情况下仍能有效搜索到全局最优参数解,且迭代插补精度和计算效率可得到显著提高．采用外逸长波辐射(OLR)逐日资料进行的插补试验对比分析表明,基于区间四分法改进的SSA迭代插补方案的缺损数据恢复的效率和精度良好．     

Asymptotic theory of parameter estimation by a contrast function based on interpolation error

Interpolation is an important issue for a variety fields of statistics (e.g., missing data analysis). In time series analysis, the best interpolator for missing points problem has been investigated in several ways. In this paper, the asymptotics of a contrast function estimator defined by pseudo interpolation error for stationary process are investigated. We estimate parameters of the process by minimizing the pseudo interpolation error written in terms of a fitted parametric spectral density and the periodogram based on observed stretch. The estimator has the consistency and asymptotical normality. Although the criterion for the interpolation problem is known as the best in the sense of smallest mean square error for past and future extrapolation, it is shown that the estimator is asymptotically inefficient in general parameter estimation, which leads to an unexpected result.     

On parametrization of interpolating curves

In parametric curve interpolation there is given a sequence of data points and corresponding parameter values (nodes), and we want to find a parametric curve that passes through data points at the associated parameter values. We consider those interpolating curves that are described by the combination of control points and blending functions. We study paths of control points and points of the interpolating curve obtained by the alteration of one node. We show geometric properties of quadratic Bézier interpolating curves with uniform and centripetal parameterizations. Finally, we propose geometric methods for the interactive modification and specification of nodes for interpolating Bézier curves.     

Determining knots by optimizing the bending and stretching energies

For a given set of data points in the plane, a new method is presented for computing a parameter value (knot) for each data point. Associated with each data point, a quadratic polynomial curve passing through three adjacent consecutive data points is constructed. The curve has one degree of freedom which can be used to optimize the shape of the curve. To obtain a better shape of the curve, the degree of freedom is determined by optimizing the bending and stretching energies of the curve so that variation of the curve is as small as possible. Between each pair of adjacent data points, two local knot intervals are constructed, and the final knot interval corresponding to these two points is determined by a combination of the two local knot intervals. Experiments show that the curves constructed using the knots by the new method generally have better interpolation precision than the ones constructed using the knots by the existing local methods.     

基于轮廓关键点的B样条曲线拟合算法

针对逆向工程中的点云切片轮廓数据点列,提出一种基于轮廓关键点的B样条曲线拟合算法.在确保扫描线点列形状保真度的前提下,首先对其进行等距重采样等预处理,并遴选出曲线轮廓关键点,生成初始插值曲线;再利用邻域点比较法求出初始曲线与各采样点间的偏差值,在超过拟合允差处增加新的关键点,并生成新的插值曲线,重复该步骤至拟合曲线满足预定精度要求.实验表明,在对稠密的二维断面数据点进行B样条逼近时,该算法能有效压缩控制顶点数目,并具有较高的计算效率.同时,由于所得控制顶点的分布能准确反映曲线的曲率变化,该方法还可作为误差约束的曲线逼近中的迭代步骤之一.     

Arc Length Estimation and the Convergence of Polynomial Curve Interpolation

When fitting parametric polynomial curves to sequences of points or derivatives we have to choose suitable parameter values at the interpolation points. This paper investigates the effect of the parameterization on the approximation order of the interpolation. We show that chord length parameter values yield full approximation order when the polynomial degree is at most three. We obtain full approximation order for arbitrary degree by developing an algorithm which generates more and more accurate approximations to arc length: the lengths of the segments of an interpolant of one degree provide parameter intervals for interpolants of degree two higher. The algorithm can also be used to estimate the length of a curve and its arc-length derivatives. AMS subject classification (2000) 65D05, 65D10     

Smooth curve interpolation

In a recent paper [1] a method was presented for smooth curve interpolation by means of minimising the energy of an idealised elastic beam constrained to pass through given data points. This method of obtaining the curve required an enormous amount of computation, since it involved the repeated solution of a fourth order differential equation and the minimisation of a function of many variables, the number of variables being equal to the number of data points. In this paper a much simpler method is presented for finding the minimum energy curve in which the minimisation procedure is eliminated. An ALGOL procedure to perform the curve fit is supplied.     

球面上的曲面插值

<正>1引言随着现代工业生产的飞速发展,航空、气象、环境监测等领域需要研究解决限制在曲面上的四维数据插值问题,即由有限个位置处的信息推测其它若干位置点的信息.例如,地球上某个地区的温度分布、降雨量分布、大气层的"温室效应"等;飞行器(飞机、火箭、导弹等)表面压力分布规律、肿瘤的生长规律等.这些在数学上都可归结为限制在曲面上的曲面插值与逼近问题.这个问题自Barnhill提出以后,人们针对限制在球面上     

Interpolation by $G^2$ Quintic Pythagorean-Hodograph Curves

In this paper, the $G^2$ interpolation by Pythagorean-hodograph (PH) quintic curves in $\mathbb{R}^d$, $d ≥2$, is considered. The obtained results turn out as a useful tool in practical applications. Independently of the dimension $d$, they supply a $G^2$ quintic PH spline that locally interpolates two points, two tangent directions and two curvature vectors at these points. The interpolation problem considered is reduced to a system of two polynomial equations involving only tangent lengths of the interpolating curve as unknowns. Although several solutions might exist, the way to obtain the most promising one is suggested based on a thorough asymptotic analysis of the smooth data case. The numerical algorithm traces this solution from a particular set of data to the general case by a homotopy continuation method. Numerical examples confirm the efficiency of the proposed method.     

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

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

Optimal sampling and curve interpolation via wavelets

We propose a wavelet-based method for determining optimal sampling positions and inferring underlying functions based on the samples when it is known that the underlying function is Lipschitz. We first propose a Lipschitz regularity-based statistical model for data which are sampled from a Lipschitz curve. And then we propose a wavelet-based interpolation method for generating a Lipschitz curve given a set of points, and derive the optimal sampling positions.     

OnG 2 continuous cubic spline interpolation

In this paper the interpolation byG ² continuous planar cubic Bézier spline curves is studied. The interpolation is based upon the underlying curve points and the end tangent directions only, and could be viewed as an extension of the cubic spline interpolation to the curve case. Two boundary, and two interior points are interpolated per each spline section. It is shown that under certain conditions the interpolation problem is asymptotically solvable, and for a smooth curvef the optimal approximation order is achieved. The practical experiments demonstrate the interpolation to be very satisfactory. Supported in prat by the Ministry of Science and Technology of Slovenjia, and in part by the NSF and SF of National Educational Committee of China.     

MODIFIABLE QUARTIC AND QUINTIC CURVES WITH SHAPE-PARAMETERS

1　IntroductionBecause of their good properties,the cubic Bézier,B-spline and NURBScurves play animportantrole in CAD,CAGD and modeling systems.When interpolation by the abovecurvesto all ora partofthe control pointsisrequired,itis necessary eitherto find new control pointsby solving a system of linear equations or to insert additional control points. Moreover,thewhole interpolating curve may be affected by moving an individual control point[1～ 6] .By uisng the matrix form ofthe Bernst…     

Circular spline fitting using an evolution process

We propose a new method to approximate a given set of ordered data points by a spatial circular spline curve. At first an initial circular spline curve is generated by biarc interpolation. Then an evolution process based on a least-squares approximation is applied to the curve. During the evolution process, the circular spline curve converges dynamically to a stable shape. Our method does not need any tangent information. During the evolution process, the number of arcs is automatically adapted to the data such that the final curve contains as few arc arcs as possible. We prove that the evolution process is equivalent to a Gauss-Newton-type method.     

参数曲线近似弧长参数化的三角函数方法

本描述了一种局部的近似弧长参数化插值方法，用三角函数对曲线的弧长函数进行分段逼近，段与段之间是相互独立的，且插值曲线在插值点处的弧长与原参数曲线的真实弧长相等。     

NURBS曲线曲面拟合数据点的迭代算法

本文推广了文献[1]的结果,将文献[1]中关于B样条曲线曲面拟合数据点的迭代算法推广至有理形式,给出了无需求解方程组反求控制点及权因子即可得到拟合NURBS曲线曲面的迭代方法．该算法和文献[1]的算法本质上是统一的,而后者恰是前者的一种退化形式．文章还给出了收敛性证明以及一些定性分析．文末的数值实例说明该算法简单实用．