一类二次曲面上的参数样条

在空间四个有序数据点所确定的一个二次曲面上,可以构造一类特殊的曲线。给出了四个形状控制因子的有理基函数,以及通过研究其参数间的函数关系定义函数集,构造一类样条曲线,使得通过改变控制因子能任意精确地逼近控制多边形。这类样条曲线端点处满足一定切线方向和有界曲率,容易将它们拼接成一条逼近样条曲线。利用这些样条构造出逼近样条曲面,具有更多的自由度。     

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.     

高精度三次参数样条曲线的构造

构造参数样条曲线的关键是选取节点，该文讨论了GC^2三次参数样条曲线需满足的连续性方程，提出了构造GC^2三次参数样条曲线的新方法，在讨论了平面有序五点确定一组三次多项式函数曲线，平面有序六点唯一确定一条三次多项式函数曲线的基础上，提出了计算相邻两区间上的节点的算法，构造的插值曲线具有三次多项式函数精,该文还以实例对新方法与其它方法构造的插值曲线的精度进行了比较。     

The cubic spline solution of practical problems modelled by hyperbolic partial differential equations

An approximation is developed for a general one-dimensional hyperbolic partial differential equation with constant coefficients and function value boundary conditions. The time derivative is replaced by a finite difference representation and the space derivative by a cubic spline. As expected, a three-level finite difference formula in time is obtained giving the solution at each succeeding time level. The spline approximation produces a spline function which can be used on each time level to obtain the solution at any points intermediate to the mesh points. The numerical scheme is extended to the more general variable-coefficient case and for derivative boundary conditions. Truncation errors and stability criteria are produced, and the scheme is rigorously tested on practical problems, a comparison being made with a more well-known fully implicit finite difference scheme.     

带形状控制的自由曲线曲面参数样条

目的 样条曲线曲面的构造是工程制图中的一个重要部分。针对双曲抛物面上参数样条曲线的构造,在已有的研究基础上提出了一种样条方法使曲线曲面可以任意地逼近一个多边形或者一个网格。方法 在标准四面体内构造一个双曲抛物面,在该曲面上以基函数参数化的方法定义一种带形状参数的参数样条曲线曲面,样条基函数通过将双曲抛物面的有理参数化进行限定,生成单参数有理样条基函数。详细研究了样条的保形性及其端点性质。结果 样条曲线具有一个可变的形状控制因子,可以对曲线进行调整,能以任意精度逼近这个控制四边形或网格。对空间节点列,利用该样条可以生成G²-连续空间曲线,同样对于空间网格可以构造G²-连续的拟合曲面,它所对应的基函数可以是有理形式。结论 实验结果表明,本文在笔者已有的研究基础上提出的参数样条曲线可以通过重心坐标系变换适应为任意的四边形,除了空间四面体内的样条曲线,四面体退化成四边形同样可实现。     

基于约束优化的B样条曲线形状修改

B样条曲线广泛应用于计算机辅助几何设计(CAGD),并且与Bézier曲线等其它著名曲线相比,在形状设计方面有其更独特的性质。对曲线的设计和形状的修改是一个重要的课题,也是计算机图形学、CAD/CAM和数控技术领域最重要的研究主题之一。论文运用约束优化的方法,修改均匀B-样条的控制点,使B样条曲线通过调整的控制点,使修改前后曲线的距离范数达到最小,并给出相应的实例说明算法的有效性。     

网格图形编辑的样条方法

提出基于样条的网格图形编辑方法,首先在网格表面附近构建近似的样条曲面,同时预计算网格顶点在样条上的对应点处局部标架下的坐标表示,并作为不变量在变形中进行保持;然后编辑样条的位置和形状,利用局部标架和细节坐标重建变形后的网格,同时进行网格光滑和网格细分,改善变形效果,以实现复杂模型简单快捷的编辑/变形.方法在保细节的同时允许对网格在多个尺度下编辑.实验结果表明,融合了样条的三角网格方法较传统的样条编辑方法可避免产生过多的控制点,大大地简化了操作.     

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.     

一种B样条曲线描述图像边界的算法

型值点的个数与分布对B样条曲线的形状有直接影响,为了让B样条曲线能很好地描述图像区域边缘,研究了一种自适应3次非均匀B样条曲线插值算法。利用B样条曲线在型值点处曲率较大的性质,调整型值点的位置和个数,通过B样条曲线与图像边缘的误差,对型值点进一步优化,使B样条曲线贴合边缘。实验结果表明,该方法得到的B样条曲线能很好地描述区域边缘。     

A Recursive Subdivision Algorithm for Piecewise Circular Spline

We present an algorithm for generating a piecewise G ¹ circular spline curve from an arbitrary given control polygon. For every corner, a circular biarc is generated with each piece being parameterized by its arc length. This is the first subdivision scheme that produces a piecewise biarc curve that can interpolate an arbitrary set of points. It is easily adopted in a recursive subdivision surface scheme to generate surfaces with circular boundaries with pieces parameterized by arc length, a property not previously available. As an application, a modified version of Doo–Sabin subdivision algorithm is outlined making it possible to blend a subdivision surface with other surfaces having circular boundaries such as cylinders.     

Bézier样条曲线改进的近似弧长参数化方法

提出了Bézier样条曲线利用分割技术近似弧长参数化的一种方法,并给出了相应的算法。通过求出曲线上所谓的‘最坏点’并在相应点处进行分割,可得到两条Bézier样条曲线。让这两条Bézier样条曲线具有与它们的近似弧长成比例的权,并对所得到的新的Bézier样条曲线进行同样的工作最终可得到一条由多条Bézier样条曲线所构成的新曲线。将这多条Bézier样条曲线合并成为一条Bézier样条曲线并通过节点插入技术将所得Bézier样条曲线转化为B-样条曲线的形式可得到全局参数域,其中各条Bézier曲线在全局参数域中所占子区间的长度与它们的权成比例,这样便得到了一条近似弧长参数化曲线。     

C2 interpolation of spatial data subject to arc-length constraints using Pythagorean–hodograph quintic splines

In order to reconstruct spatial curves from discrete electronic sensor data, two alternative C² Pythagorean–hodograph (PH) quintic spline formulations are proposed, interpolating given spatial data subject to prescribed constraints on the arc length of each spline segment. The first approach is concerned with the interpolation of a sequence of points, while the second addresses the interpolation of derivatives only (without spatial localization). The special structure of PH curves allows the arc-length conditions to be expressed as algebraic constraints on the curve coefficients. The C² PH quintic splines are thus defined through minimization of a quadratic function subject to quadratic constraints, and a close starting approximation to the desired solution is identified in order to facilitate efficient construction by iterative methods. The C² PH spline constructions are illustrated by several computed examples.     

圆渐开线平面插值样条及其应用

利用拼接的圆渐开线实现对平面上的数据点及其切向的插值,通过解决两点及其切向的圆渐开线插值,以及在各种不同情况下的插值处理方法,提供了圆渐开线平面插值样条的生成算法,由于圆渐开线为凸曲线,其曲率与弧长成反比,因此其样条曲线对插值曲线的形状控制是有利的,并可作为圆弧样条插值方法的一种扩展。     

Bézier样条曲线的近似弧长参数化方法

提出了Bézier样条曲线近似弧长参数化的方法及相应的算法。通过求出曲线近似二分之一弧长的点及其相应的参数值,可将曲线分割为两条Bézier样条曲线。这两条曲线的弧长近似相等,因此让它们带有相同的权1。对新生成的Bézier样条曲线不断重复上述工作,最终得到一条由多条Bézier样条曲线所构成的新的曲线。将这多条Bézier样条曲线合并为一条Bézier样条曲线,进而通过节点插入技术将其转化为B样条形式的曲线以便得到全局参数,其中各段Bézier曲线在全局参数域中所占子区间的长度与它们所具有的权成比例,这样便得到一条近似弧长参数化曲线。     

单圆弧样条保形插值算法

该文以插值具有偶数个点的闭多边形为例提出了一种新的圆弧样条插值算法。这种算法具有以下3个特点：（1）生成的圆弧样条曲线具有保形的特点；（2）圆弧样条中圆弧的段数与型值点个数相同。（3）圆弧段之间的连接点不一定在插值的型值点上，这样就能用更多的自由度来控制拟合曲线的形状。同此文中还提出了一个优化的算法来得到光顺的插值曲线，同时还给出了几个例子加以说明。     

A new algorithm based on spline in tension approximation for 1D quasi-linear parabolic equations on a variable mesh

In this paper, we propose a new two-level implicit method of order two in time and four in space directions, based on spline in tension approximation for the numerical solution of one space dimensional quasi-linear parabolic partial differential equation on a uniform mesh. We have discussed the derivation of the proposed method in detail and have also discussed the stability analysis for a model problem. We have extended the method to non-uniform mesh. Numerical results are given to illustrate the usefulness of the proposed methods.     

Hybridizing mesh adaptive search algorithm and artificial immune systems for discrete rational Bézier curve approximation

This paper is an extension of a previous one presented at the conference Cyberworlds 2014. In that work we addressed the problem of obtaining the rational Bézier curve that fits a given set of data points better in the least-squares sense. Our approach was based on the clonal selection theory principles to compute all parameters of the problem, namely, the control points of the approximating curve, their corresponding weights, and a suitable parameterization of data points. Although we were able to obtain results with good accuracy, this scheme can still be significantly improved by hybridizing it with an efficient local search procedure. This is the approach proposed in this paper. In particular, we consider the mesh adaptive search algorithm, a direct search method aimed at improving the local search step to refine the quality of the solution. This hybrid strategy has been applied to six illustrative free-form shapes exhibiting challenging features, including the three examples in previous paper. A comparative analysis of our results with respect to the previous methodology is also reported. Our experimental results show that this hybrid scheme performs extremely well. It also outperforms the previous approach for all instances in our benchmark.     

一种类四次三角样条曲线

针对B样条曲线相对于其控制多边形形状固定,以及不能描述除抛物线以外的圆锥曲线的不足进行改进。将形状参数与三角函数进行有机结合,构造了一组含参数的三角基,由这组基定义了带形状参数的三角样条曲线,其每一段由相继的5个控制顶点生成。新曲线在继承B样条曲线主要优点的同时,既具有形状可调性,又能精确表示椭圆,对于等距节点,在一般情况下曲线C³连续,当形状参数取特殊值时曲线可达C⁵连续。采用张量积方法,将曲线推广后所得到的曲面具有与曲线类似的性质,给出了用曲面表示椭球面的方法。     

Online Clustering with Variable Sized Clusters

Online clustering problems are problems where the classification of points into sets (called clusters) is performed in an online fashion. Points arrive at arbitrary locations, one by one, to be assigned to clusters at the time of arrival. A point can be either assigned to an existing cluster or a new cluster can be opened for it. Here, we study a one-dimensional variant on a line. Each cluster is a closed interval, and there is no restriction on the length of a cluster. The cost of a cluster is the sum of a fixed set-up cost and its diameter (or length). The goal is to minimize the sum of costs of the clusters used by the algorithm. We study several variants, each having the two essential properties that a point which has been assigned to a given cluster must remain assigned to that cluster and no pair of clusters can be merged. In the strict variant, the diameter and the exact location of the cluster must be fixed when it is initialized. In the flexible variant, the algorithm can shift the cluster or expand it, as long as it contains all points assigned to it. In an intermediate model, the diameter is fixed in advance but the exact location can be modified. Here we give tight bounds on the competitive ratio of any online algorithm in each of these variants. In addition, for each model we also consider the semi-online case where points are presented ordered by their location.     

带有给定切线多边形的C5连续有理样条曲线

描述了一种与给定多边形相切的有理样条曲线的算法。在算法中,所有的有理样条曲线的控制点可以通过对多边形的顶点简单计算产生。所构造的曲线对多边形具有保形性。曲线可以局部修改。最后给出了两个算例。