带形状参数的代数三角样条曲线曲面的构造（英文）

The construction of trigonometric B-spline curves with shape parameters has become the hotspot in computer aided geometric design.However,the shape parameters of the curves and surfaces are all global parameters and only meet with C~2 continuity in some previous papers.In order to provide more flexible approaches for designers,the algebraic and trigonometric spline(AT-spline) curves and surfaces are constructed as a generalization of the traditional cubic uniform B-spline curves and surfaces.AT-spline curves and surfaces not only inherit the properties of trigonometric B-spline curves,but also exhibit better performance when adjusting its local shapes through two shape parameters.Particularly,the AT-spline rotational surfaces with two local shape parameters are presented.When the shape parameters take special value,it can accurately represent the conic curve and surface.     

局部形状可调整的三次有理B样条插值曲线

利用三次非均匀有理B样条,给出了一种构造局部插值曲线的方法,生成的插值曲线是C2连续的.曲线表示式中带有一个局部形状参数,随着一个局部形状参数值的增大,所给曲线将局部地接近插值点构成的控制多边形.基于三次非均匀有理B样条函数的局部单调性和一种保单调性的准则,给出了所给插值曲线的保单调性的条件.     

On the quartic curve of Han

The quartic curve of Han [X. Han, Piecewise quartic polynomial curves with shape parameter, Journal of Computational and Applied Mathematics 195 (2006) 34–45] can be considered as the generalization of the cubic B-spline curve incorporating shape parameters into the polynomial basis functions. We show that this curve can be considered as the linear blending of the original cubic B-spline curve and a fixed quartic curve. Moreover, we present the Bézier form of the curve, which is useful in terms of incorporating the curve into existing CAD systems. Geometric effects of the alteration of shape parameters is also discussed, including design oriented computational methods for constrained shape control of the curve.     

B样条基的转换矩阵及其应用

本文研究任意两个B样条基可转换的条件及转换矩阵，给出了关于转换矩阵元素的表示及性质等理论结果，并推导出了两个递推公式，为实际计算转换矩阵的元素提供了易于实现的数学方法。本文还讨论了B样条基转换矩阵在CAGD中的应用，特别讨论了B样条曲线的节点插入、升阶和分解问题。本文的结果为B样条曲线的节点插入、升阶、分解等运算提供了一个统一的数学模型和实现方法。     

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

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.     

Quantum B-splines

Quantum splines are piecewise polynomials whose quantum derivatives (i.e. certain discrete derivatives or equivalently certain divided differences) agree up to some order at the joins. Just like classical splines, quantum splines admit a canonical basis with compact support: the quantum B-splines. These quantum B-splines are the q-analogues of classical B-splines. Here quantum B-spline bases and quantum B-spline curves are investigated, using a new variant of the blossom: the q (quantum)-blossom. The q-blossom of a degree d polynomial is the unique symmetric, multiaffine function in d variables that reduces to the polynomial along the q-diagonal. By applying the q-blossom, algorithms and identities for quantum B-spline bases and quantum B-spline curves are developed, including quantum variants of the de Boor algorithms for recursive evaluation and quantum differentiation, knot insertion procedures for converting from quantum B-spline to piecewise quantum Bézier form, and a quantum variant of Marsden’s identity.     

Recursive polynomial curve schemes and computer-aided geometric design

A class of polynomial curve schemes is introduced that may have widespread application to CAGD (computer-aided geometric design), and which contains many well-known curve schemes, including Bézier curves, Lagrange polynomials, B-spline curve (segments), and Catmull-Rom spline (segments). The curves in this class can be characterized by a simple recursion formula. They are also shown to have many properties desirable for CAGD; in particular they are affine invariant, have the convex hull property, and possess a recursive evaluation algorithm. Further, these curves have shape parameters which may be used as a design tool for introducing such geometric effects as tautness, bias, or interpolation. The link between probability theory and this class of curves is also discussed.Communicated by Klaus Höllig.     

A generalization of the variation diminishing property

For totally positive matrices, a new variation diminishing property on the sign of consecutive minors is obtained. this property is used to show shape preserving properties of curves generated by totally positive bases and, in particular, of B-spline curves.     

Bounds on partial derivatives of NURBS surfaces

In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.     

A generalization of the variation diminishing property

For totally positive matrices, a new variation diminishing property on the sign of consecutive minors is obtained. this property is used to show shape preserving properties of curves generated by totally positive bases and, in particular, of B-spline curves. Partially supported by DGICYT PS93-0310.     

有理B-样条曲线、曲面的包络性质

研究有理Bezier曲线和B-样条曲线、曲面的包络性质,愈来愈广泛,因为它从包络磨光的角度解释了曲线、曲面的一种几何构造特征,形象地说明了模型是由多边形或多面体逐步磨光的结果.     

B样条基转换矩阵的解析表示和计算公式

摘要B样条基的转换矩阵具有重要的理论和应用意义。本文研究其最基本的问题：存在性条件、解析表示和计算方法，利用差商展开系数得到了上述问题的有关结果，本文的结果为CAGD中B样条曲线的节点插入、节点删除、升阶、降阶、分割、组合等重要技术提供了一个统一的数学背景和实现方法。     

复二次B样条曲线

本文在复平面单位圆弧上引进了复二次Ｂ样条曲线，讨论了它的一些几何性质．实质上它是分段帕斯卡蜗线段的Ｃ１合成曲线．调整控制点可使某段曲线为圆孤．     

周期B样条基转换矩阵的表示和计算

周期B样条基以一种简洁的形式表示闭B样条曲线.周期B样条基转换矩阵为闭B样条曲线及相关曲面的不同表示间的转换提供了一个数学模型.本文给出了周期B样条基转换矩阵的存在性条件,给出并证明了周期B样条基转换矩阵的一个简单的递归表示式.在此基础上,本文进一步给出了周期B样条基转换矩阵的计算公式和高效算法.周期B样条基转换矩阵为闭B样条曲线的节点插入、升阶、节点删除和降阶等基本运算提供了一个统一而简单的解决方法,本文给出了一些应用例子.     

de Boor-Fix dual functionals and algorithms for Tchebycheffian B-spline curves

The de Boor-Fix dual functionals are a potent tool for deriving results about piecewise polynomial B-spline curves. In this paper we extend these functionals to Tchebycheffian B-spline curves and then use them to derive fundamental algorithms that are natural generalizations of algorithms for piecewise polynomial B-spline algorithms. Then, as a further example of the utility of this approach, we introduce “geometrically continuous Tchebycheffian spline curves,” and show that a further generalization works for them as well.     

A unified approach to B-spline recursions and knot insertion, with application to new recursion formulas

We present a unified approach to and a generalization of almost all known recursion schemes concerning B-spline functions. This includes formulas for the computation of a B-spline's values, its derivatives (ordinary and partial), and for a knot insertion method for B-spline curves. Furthermore, our generalization allows us to derive also some new relations for these purposes.     

Degree reduction of B-spline curves

An algorithmic approach to degree reduction of B-spline curves is presented. The new algorithms are based on the blossoming process and its matrix representation. The degree reduction of B-spline curves are obtained by the generalized least square method. The computations are carried out by minimizing theL ₂ distance between the two curves.     

A unified approach to B-spline recursions and knot insertion,with application to new recursion formulas

We present a unified approach to and a generalization of almost all known recursion schemes concerning B-spline functions. This includes formulas for the computation of a B-spline's values, its derivatives (ordinary and partial), and for a knot insertion method for B-spline curves. Furthermore, our generalization allows us to derive also some new relations for these purposes.     

Discrete Variational Calculus for B-Spline Curves

In this work, we study discrete variational problems, for B-spline curves, which are invariant under translation and rotation. We show this approach has advantages over studying smooth variational problems whose solutions are approximated by B-spline curves. The latter method has been well studied in the literature but leads to high order approximation problems. We are particularly interested in Lagrangians that are invariant under the special Euclidean group for which B-spline approximated curves are well suited. The main application we present here is the curve completion problem in 2D and 3D. Here, the aim is to find various aesthetically pleasing solutions as opposed to a solution of a physical problem. Smooth Lagrangians with special Euclidean symmetries involve curvature, torsion, and arc length. Expressions of these, in the original coordinates, are highly complex. We show that, by contrast, relatively simple discrete Lagrangians offer excellent results for the curve completion problem. The novel methods we develop for the discrete curve completion problem are general, and can be used to solve other discrete variational problems for B-spline curves. Our method completely avoids the difficulties of high order smooth differential invariants.     

Changeable degree spline basis functions

A B-spline basis function is a piecewise function of polynomials of equal degree on its support interval. This paper extends B-spline basis functions to changeable degree spline (CD-spline for short) basis functions, each of which may consist of polynomials of different degrees on its support interval. The CD-spline basis functions possess many B-spline-like properties and include the B-spline basis functions as subcases. Their corresponding parametric curves, called CD-spline curves, are like B-spline curves and also have many good properties. If we use the CD-spline basis functions to design a curve made up of polynomial segments of different degrees, the number of control points may be decreased.