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

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

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

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

递归曲线的矩阵表示和构造方法

本文给出了递归曲线的矩阵表示和构造W曲线以及L曲线的比例因子方法．揭示了Bernstein基函数和等距B样条函数以及不等距重节点B样条函数之间的一种简单的内在关系．     

一类双k次B样条曲面的G1连续性条件

本文针对两个k×k次B样条曲面的节点向量为端点插值、内部是单节点的情形 ,给出它们之间的G1光滑拼接条件 ,同时得到它们的公共边界曲线的控制顶点所要满足的本征方程 .其中本征方程是B样条曲面片所独有的现象 .     

B样条曲线升阶的新研究

B样条曲线的升阶是CAGD中的一个重要课题。本文根据传统的样条函数理论，提出了一个用高次B样条函数表示低次B样条函数的方法。该方法用于B样条曲线的升阶是快捷、有效的。     

二次带形状参数双曲B样条曲线

在空间Ω_5=span{1,sinh t,cosh t,sinh 2t,cosh 2t}上给出了二次带形状参数双曲B样条的基函数.由这组基组成的二次双曲B样条曲线是C~1连续的,同时具有很多与二次B样条曲线类似的性质和几何结构,并且可以精确表示双曲线.在控制多边形固定的情况下,可以通过调节形状参数的大小来进一步调整曲线的形状.     

一类非端点插值B样条曲线降阶的方法

降阶算法是B样条曲线和曲面设计的一个基本算法,它广泛应用于组合曲线,蒙皮或扫描曲面等设计中.Piegl与Tiller曾给出B样条曲线的降阶方法.本文给出了解决更一般的非端点插值B样条曲线降阶的方法.新的方法主要是通过对现有的节点插入方法进行分析,给出了一种端点插值递推公式,并利用此公式对Piegl与Tiller降阶方法加以改进,使之能够解决非端点插值均匀及非均匀B样条曲线的降阶问题.     

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

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

T-B样条曲线及其应用

给出一种基于三角函数的类B样条设计方法,称其为 T B样条,它具有 B样条曲线曲面的主要优点,它还能够无需有理形式即可精确表示圆弧、椭圆弧等二次曲线弧以及球面、椭球面等二次曲面片.     

广义非参数回归的B样本贝叶斯估计

本文主要研究广义非参数模型B样条Bayes估计 .将回归函数按照B样条基展开 ,我们不具体选择节点的个数 ,而是节点个数取均匀的无信息先验 ,样条函数系数取正态先验 ,用B样条函数的后验均值估计回归函数 .并给出了回归函数B样条Bayes估计的MCMC的模拟计算方法 .通过对Logistic非参数回归的模拟研究 ,表明B样条Bayes估计得到了很好的估计效果     

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices

We show that many fundamental algorithms and techniques for B-spline curves extend to geometrically continuous splines. The algorithms, which are all related to knot insertion, include recursive evaluation, differentiation, and change of basis. While the algorithms for geometrically continuous splines are not as computationally simple as those for B-spline curves, they share the same general structure. The techniques we investigate include knot insertion, dual functionals, and polar forms; these prove to be useful theoretical tools for studying geometrically continuous splines.     

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.     

C-Bézier和B-型样条闭曲线光滑性研究

本文研究了与多边形相切的样条曲线的构造方法和基本属性问题,给出了曲线光顺度的一般定义和计算方法.利用该方法对分段C-Bézier曲线、4-5-5-4次交错B-样条曲线和3阶B样条曲线的光顺度进行计算,获得了3阶B样条曲线最为光顺的结果.     

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.     

Approximate merging of B-spline curves and surfaces

Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.     

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

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.     

NUAT T-splines of odd bi-degree and local refinement

This paper presents a new kind of spline surfaces, named non-uniform algebraic- trigonometric T-spline surfaces （NUAT T-splines for short） of odd hi-degree. The NUAT T- spline surfaces are defined by applying the T-spline framework to the non-uniform algebraic- trigonometric B-spline surfaces （NUAT B-spline surfaces）. Based on the knot insertion algorithm of the NUAT B-splines, a local refinement algorithm for the NUAT T-splines is given. This algorithm guarantees that the resulting control grid is a T-mesh as the original one. Finally, we prove that, for any NUAT T-spline of odd hi-degree, the linear independence of its blending functions can be determined by computing the rank of the NUAT T-spline-to-NUAT B-spline transformation matrix.     

Computing ECT-B-splines recursively

ECT-spline curves for sequences of multiple knots are generated from different local ECT-systems via connection matrices. Under appropriate assumptions there is a basis of the space of ECT-splines consisting of functions having minimal compact supports, normalized to form a nonnegative partition of unity. The basic functions can be defined by generalized divided differences [24]. This definition reduces to the classical one in case of a Schoenberg space. Under suitable assumptions it leads to a recursive method for computing the ECT-B-splines that reduces to the de Boor–Mansion–Cox recursion in case of ordinary polynomial splines and to Lyche's recursion in case of Tchebycheff splines. For sequences of simple knots and connection matrices that are nonsingular, lower triangular and totally positive the spline weights are identified as Neville–Aitken weights of certain generalized interpolation problems. For multiple knots they are limits of Neville–Aitken weights. In many cases the spline weights can be computed easily by recurrence. Our approach covers the case of Bézier-ECT-splines as well. They are defined by different local ECT-systems on knot intervals of a finite partition of a compact interval [a,b] connected at inner knots all of multiplicities zero by full connection matrices A ^[i] that are nonsingular, lower triangular and totally positive. In case of ordinary polynomials of order n they reduce to the classical Bézier polynomials. We also present a recursive algorithm of de Boor type computing ECT-spline curves pointwise. Examples of polynomial and rational B-splines constructed from given knot sequences and given connection matrices are added. For some of them we give explicit formulas of the spline weights, for others we display the B-splines or the B-spline curves. *Supported in part by INTAS 03-51-6637.