Subdivision Schemes for Thin Plate Splines

Thin plate splines are a well known entity of geometric design. They are defined as the minimizer of a variational problem whose differential operators approximate a simple notion of bending energy. Therefore, thin plate splines approximate surfaces with minimal bending energy and they are widely considered as the standard "fair" surface model. Such surfaces are desired for many modeling and design applications.
Traditionally, the way to construct such surfaces is to solve the associated variational problem using finite elements or by using analytic solutions based on radial basis functions. This paper presents a novel approach for defining and computing thin plate splines using subdivision methods. We present two methods for the construction of thin plate splines based on subdivision: A globally supported subdivision scheme which exactly minimizes the energy functional as well as a family of strictly local subdivision schemes which only utilize a small, finite number of distinct subdivision rules and approximately solve the variational problem. A tradeoff between the accuracy of the approximation and the locality of the subdivision scheme is used to pick a particular member of this family of subdivision schemes.
Later, we show applications of these approximating subdivision schemes to scattered data interpolation and the design of fair surfaces. In particular we suggest an efficient methodology for finding control points for the local subdivision scheme that will lead to an interpolating limit surface and demonstrate how the schemes can be used for the effective and efficient design of fair surfaces.     

Totally positive bases for shape preserving curve design and optimality of B-splines

Normalized totally positive (NTP) bases present good shape preserving properties when they are used in Computer Aided Geometric Design. Here we characterize all the NTP bases of a space and obtain a test to know if they exist. Furthermore, we construct the NTP basis with optimal shape preserving properties in the sense of (Goodman and Said, 1991), that is, the shape of the control polygon of a curve with respect to the optimal basis resembles with the highest fidelity the shape of the curve among all the control polygons of the same curve corresponding to NTP bases. In particular, this is the case of the B-spline basis in the space of polynomial splines. Further examples are given.     

Curvature continuous curves and surfaces

The well-known construction of the Bézier points of a cubic spline curve or surface is generalized to curvature continuous curves and surfaces. Special examples of this kind of new splines are Nu-splines and Beta-splines.     

双曲抛物面上的一类G2连续逼近样条

在双曲抛物面上,仿射坐标系下,通过带逼近控制因子的双参数化方法,以及研究其参数间的函数关系构造出一类G2连续样条曲线。当控制多边形是平形四边形时,样条曲线段在逼近控制因子大于某个数时具有保形性质。对这类样条曲线段的逼近问题进行了一定的理论分析。     

三次TC-Bézier曲线的新扩展

给出一组含有两个参数的二次三角多项式基函数,它是三次Bernstein基函数的扩展;分析了这组基函数的性质。定义了带有两个形状参数的三角多项式曲线,它不仅具有 Bézier 曲线的一些实用的几何特性,而且具有形状的可调性。在控制多边形不变的情况下,通过改变参数α和β,可以生成不同的逼近该控制多边形的曲线,并可以精确表示圆弧、椭圆弧等。由于带有两个参数,所以具有更加灵活的形状控制能力。给出了曲线间的G₁、G₂拼接条件以及在曲线造型中的应用实例,为自由曲线设计提供了一种有效的方法。     

曲线插值约束的LOOP细分曲面

提出基于Loop细分方法的曲线插值方法,不需要修改细分规则,只需以插值曲线的控制多边形为中心多边形,向其两侧构造对称三角网格带,该对称三角网格带将收敛于插值曲线。因此,包含有该三角网格带的多面体网格的极限曲面将经过插值曲线。若要插值多条相交曲线只需在交点处构造全对称三角网格。运用该方法可在三角网格生成的细分曲面中插值多达六条的相交曲线。     

Improvement of energy model based on cubic interpolation curve

In CAGD and CG,energy model is often used to control the curves and surfaces shape.In curve/surface modeling,we can get fair curve/surface by minimizing the energy of curve/surface.However,our research indicates that in some cases we can’t get fair curves/surface using the current energy model.So an improved energy model is presented in this paper.Examples are also included to show that fair curves can be obtained using the improved energy model.     

A New Local Control Spline with Shape Parameters for CAD/CAM

Anew local control spline based on shape parameterw with G^3 continuity,called BLC-spline,is pro* posed.Not only is BLC-spline very smoot,but also the spline curve‘s characteristic polygon has only three control vertices,and the characteristic polyhedron has only nine control vertices.The behavior of Iocal control of BLC-spline is better than that of the other splines such as cubic Bezier,B and Beta-spline.The three shape parameters β0，β1and β2 of BLC-spline,which are independent of the control vertices,may be altered to change the shape of the curve or surface.It is shown that BLC-spline may be used to construcet a space are spline for DNC machining directly.That is a powerful tool for the design and manufacture of curves and surfaces in integrated CAD/CAM systems.     

一种基于特征点识别的曲线离散化方法

提出了曲线局部特征点的概念，并根据平行线原理给出了一种快速求取特征点的算法。通过对局部特征点进行优化，得到所需的局部特征点集，实现了曲线的离散。该方法在离散过程中充分考虑了离散精度误差与逼近弦长对后续三角化质量的影响。实验结果表明，由这些特征点组成的多边形可较好地逼近曲线，算法效率较高。     

A new quadratic and biquadratic algorithm for curve and surface estimation

A new deterministic quadratic parametric algorithm is introduced for curve estimation. A parametric biquadratic algorithm for surface estimation, based on the one for curve estimation is also presented. Our algorithm does not assume that the surface to be estimated, based on a given set of data in the three-dimensional space, has a continuous first derivative, nor does it assume that the data satisfy the assumption of stationarity or the intrinsic hypothesis. The grid formed by the given data does not have to be equidistant; in other words the distance between neighboring points in the two-dimensional domain does not have to be the same. Also since the algorithm leads to parametric equations for the patches of the surface, the estimating surface does not need to be a function. Appropriate parameters are introduced in the blending functions of the parametric equations to produce tension. The algorithm does not require inversion of matrices and is faster than splines and kriging. The estimated surface passes through the given data points. Error analysis based on estimating surfaces of known functions from a sample of data and then comparing to their value, are made. A comparison with biqubic natural splines based on data generated from known functions is also given.     

Curve interpolation in recursively generated B-spline surfaces over arbitrary topology

Recursive subdivision is receiving a great deal of attention in the definition of B-spline surfaces over arbitrary topology. The technique has recently been extended to generate interpolating surfaces with given normal vectors at the interpolated vertices. This paper describes an algorithm to generate recursive subdivision surfaces that interpolate B-spline curves. The control polygon of each curve is defined by a path of vertices of the polyhedral network describing the surface. The method consists of applying a one-step subdivision of the initial network and modifying the topology in the neighborhood of the vertices generated from the control polygons. Subsequent subdivisions of the modified network generate sequences of polygons each of which converges to a curve interpolated by the limit surface. In the case of regular networks, the method can be reduced to a knot insertion process.     

二次B样条曲线曲面的扩展

构造了一组由三个含参数m的函数构成的函数组, 该函数组线性无关, 称之为mB基。mB基具有非负性、规范性、对称性等良好的性质, 而且具有非常特殊的端点性质。基于mB基定义了一种新的样条曲线, 称之为mB曲线。mB曲线段可以转化为Bézier曲线的形式, 借助Bézier曲线的de Casteljau算法, 给出了mB曲线段的递推求值算法。mB曲线具有与二次均匀B样条曲线相同的端点行为, 即插值于控制多边形首末边的中点, 与控制多边形的首末边相切。另外, mB曲线的形状和连续性均可以通过参数m进行自由调节, 而且调节方式既可以是整体的, 又可以是局部的。利用张量积方法, 将mB曲线推广到了曲面, 称之为mB曲面。mB曲面具有与mB曲线类似的性质。     

带有给定切线多边形的C-Bézier闭曲线和B-型样条闭曲线

§1.引 言 Bézier曲线和B样条曲线已广泛应用到汽车、航空、造船等许多领域中.Hering讨论了与凸多边形每边相切的分段三(四)次 Bézier闭曲线和三(四)次B样条闭曲线.它的所有Bézier点必须通过求解大型方程组得到,计算量大,且曲线易出现拐点,而B样条闭曲线的控制点要通过反算得到[1].方逵改进了Hering的方法,构造了G2连续的分段三次曲线[2],基本上克服了Hering方法的两个缺点,但局部修改仍然是比较复杂的.方逵等再次研究了与任意多边形相切的分段四次和五次Bézier曲线[3],但五次Béier曲线不能作局部修改.本文的第二节研究了与任意多边形相切的分段C-Bézier曲线,该曲线C1连续的,且对切线多边形具有保形性,每段C-Bézier曲线上的控制点由切线多边形的顶点计算     

Smoothing of bicubic parametric surfaces

Bicubic parametric surfaces are often used to represent complex shapes in systems for computer-aided design and manufacture. Such as surface can be defined by a topologically rectangular mesh of cubic parametric splines, a curve which is an approximate mathematical model of the linear elastic beam.Smoothing a bicubic parametric surface can be done by smoothing the curve net that defines it. This paper describes a method for moving datapoints in a curve net to new ‘smoother’ positions. Different techniques to analyse the result of the smoothing are also discussed.     

Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics

This paper compares two techniques for the approximation of the offsets to a given planar curve. The two methods are based on approximate conversion of the planar curve into circular splines and Pythagorean hodograph (PH) splines, respectively. The circular splines are obtained using a novel variant of biarc interpolation, while the PH splines are constructed via Hermite interpolation of C¹ boundary data.We analyze the approximation order of both conversion procedures. As a new result, the C¹ Hermite interpolation with PH quintics is shown to have approximation order 4 with respect to the original curve, and 3 with respect to its offsets. In addition, we study the resulting data volume, both for the original curve and for its offsets. It is shown that PH splines outperform the circular splines for increasing accuracy, due to the higher approximation order.     

Sketching Clothoid Splines Using Shortest Paths

Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, constructing them from hand‐drawn strokes remains difficult. Building on recent results, we describe a novel algorithm for approximating a sketched stroke with a fair (i.e., visually pleasing) clothoid spline. Fairness depends on proper segmentation of the stroke into curve primitives — lines, arcs, and clothoids. Our main idea is to cast the segmentation as a shortest path problem on a carefully constructed weighted graph. The nodes in our graph correspond to a vastly overcomplete set of curve primitives that are fit to every subsegment of the sketch, and edges correspond to transitions of a specified degree of continuity between curve primitives. The shortest path in the graph corresponds to a desirable segmentation of the input curve. Once the segmentation is found, the primitives are fit to the curve using non‐linear constrained optimization. We demonstrate that the curves produced by our method have good curvature profiles, while staying close to the user sketch.     

二次双曲Bézier曲线曲面

为了简化构造组合曲线时,相邻曲线的控制顶点间应满足的光滑拼接条件,构造了一种结构类似于二次Bézier曲线的含参数的双曲型曲线,称之为H-Bézier曲线。该曲线具有Bézier曲线的许多基本性质,如凸包性、对称性、几何不变性、端点插值和端边相切性。另外,该曲线具备形状可调性,可以精确表示双曲线。此外,若取特殊的参数,则当相邻H-Bézier曲线的控制顶点间满足普通Bézier曲线的G1光滑拼接条件时,曲线在公共连接点处可以达到G3光滑拼接。另外,给出了构造与给定多边形相切的H-Bézier曲线的方法,该方法简单有效,而且整条曲线对给定的切线多边形是保形的。运用张量积方法,将H-Bézier曲线推广后得到的曲面同样具有很多良好的性质。     

一种类四次三角样条曲线

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

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

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