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

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

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

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

Beziel曲线与B样条曲线的升阶公式

Bezier曲线的升阶公式在[1]中给出了简单的递推表达式,而B样条曲线的升阶公式则相对地复杂,本文利用[4]提出的n次多项式的blossom即一个与此多项式一一对应的对称的n—仿射映射,给出了Bezier曲线和B样条曲线直接升r阶的升阶公式。     

广义样条的递推式

多项式样条空间最重要的性质之一是它具有B样条基。这种B样条基能借助递推公式进行有效而精确的计算。[1]证明了三角样条空间也有满足类似递推式的B样条。[2]称双曲B样条也有这种递推式,其结果[4]最近才发表。 对于各种广义样条空间,诸如Tchebysheff样条空间,L样条空间,Lg样条空间等,都能构造具有局部支集的基。但这些基能否用递推式加以计算的问题一直未能解决。     

一元B样条的B网观点

1.问题的提出 近年来,多元样条的研究进程表明,从多变量的观点重新认识一元样条的理论是很有必要的.本文运用重心坐标,以近代的B网方法为工具,重新探讨一元分片多项式的结构,进而为研究多元样条提供工具. 假设Q_n(t)是给定的分割:     

带有面积约束的B样条曲线拟合方法

1984年刘鼎元等给出了B样条曲线的光顺拟合方法,本文在其基础上处理了带有面积约束的B样条曲线拟合问题。它来源于船舶线型设计:设计者往往先确定横剖面面积曲线,再设计线型。因而,在横剖面的光顺拟合中,就要求各站的横剖面面积保持不变。本文用B样条参数曲线表达拟合曲线,导出了曲线与坐标轴所围面积的表达式,目标函数由偏离的平方和、二阶导数平方和以及Lagrange乘子与面积公式的乘积所组成。     

三元四方向四面体剖分上的B样条

研究了三维样条构造的一些本质困难,把有关二元三方向上样条的结果推广到三维空间,得到了三元四方向四面体剖分和相应的B样条及其支集和积分、微分差分公式.结果可直接推广到更高维空间中去,也可应用于小波分析中.     

B样条曲线升阶的新研究

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

一类算子B样条的递推公式

本文从广义差商-Green函数-B样条的观点出发,绘出了以正则系统{Φi-1(x)}_i-1m为基解组的一类微分算子的正规B样条的递推公式.     

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

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

关于三次样条函数导数的某些不等式

设△:。~x。相似文献   

Construction of Cubature Formulas via Bivariate Quadratic Spline Spaces over Non-Uniform Type-2 Triangulation

In this paper, matrix representations of the best spline quasi-interpolating operator over triangular sub-domains in $S^1_2 (∆^{(2)}_{mn})$, and coefficients of splines in terms of B-net are reviewed firstly. Moreover, by means of coefficients in terms of B-net, computation of bivariate numerical cubature over triangular sub-domains with respect to variables $x$ and $y$ is transferred into summation of coefficients of splines in terms of B-net. Thus concise bivariate cubature formulas are constructed over rectangular sub-domain. Furthermore, by means of module of continuity and max-norms, error estimates for cubature formulas are derived over both sub-domains and the domain.     

Bivariate polynomial and continued fraction interpolation over ortho-triples

By means of the barycentric coordinates expression of the interpolating polynomial over each ortho-triple, some properties are obtained. Moreover, the explicit coefficients in terms of B-net for one ortho-triple, and two ortho-triples are worked out, respectively. Thus the computation of multiple integrals can be converted into the sum of the coefficients in terms of the B-net over triangular domain much effectively and conveniently. Based on a new symmetrical algorithm of partial inverse differences, a novel continued fractions interpolation scheme is presented over arbitrary ortho-triples in R², which is a bivariate osculatory interpolation formula with one-order partial derivatives at all corner points in the ortho-triples. Furthermore, its characterization theorem is presented by three-term recurrence relations. The new scheme is advantageous over the polynomial one with some numerical examples.     

Moments and Fourier transforms of B-splines

The problem of determining the moments and the Fourier transforms of B-splines with arbitrary knots is considered. There exists a simple connection between the moments of such splines and the so-called extended Stirling numbers of the second kind which are defined in section 2. Some recurrence relations for the moments of B-splines with arbitrary knots are given in section 3. In the case of equidistant knots we have also further recurrences. For the forward, central and perfect B-splines the explicit formulas for the moments are given in section 3. The Fourier transforms of B-splines is treated in section 4. The final section is devoted to so-called Stieltjes series connected with the nonnegative weight function w(x) and such that $\text{∫}\text{a}\text{b}\text{w(x) dx}\text{> 0}$ in some closed interval [a, b]. It is proved that such series for the particular values of the independent variable may be expressed by the finite sums which contain the nodes and coefficients of the optimal (in the Davies sense) quadrature formulas.     

Recurrence relations for Tchebycheffian B-splines

Four-term recurrence relations with constant coefficients are derived for a wide class of T chebycheffian B-splines, LB-splines and complex B-splines. Such a relation exists whenever the differential operator defining the underlying “polynomial” space can be factored in two essentially different ways. The four lower order B-splines in the recurrence relation appear in two pairs, each pair corresponding to one of these factorization. It is shown that the two-term recurrence relations for polynomial, trigonometric and hyperbolic B-splines as well as other known two-term recurrence relations are obtained directly from the four-term recurrence relations in a unified and systematic way. The above derivation also yields two different two-term recurrence relations for Green’s functions of these “polynomial” spaces In this context the special examples of exponential functions and rational functions are analyzed in detail.     

图簇Y_(λ_kδ)∪β_kS_δ~*的伴随分解及其补图的色等价性

设P_n是具有n个顶点的路,令δ=rn+1,我们S_δ~*表示把rP_(n+1)的每个分支的一个1度点重迭在一起得到的图.用Y_(λ_1δ)~(S*)表示把r_1S_δ~*中每个分支的r度顶点与S_δ~*的r度顶点依次邻接后得到的图,Y_(λ_2δ)~(S*)表示把用r_2Y_(λ_1δ)~(S*)中每个分支的r+r1度顶点与S_δ~*的r度顶点依次邻接后得到的图,一般地,Y_(λ_kδ)~(S*)表示把用r_kY_(λ_(k-1)δ)~(S*)中每个分支的r+r_k-1度顶点与S_δ~*的r度顶点依次邻接后得到的图,运用图的伴随多项式的性质,证明了图Y_(λ_kδ)~(S*)∪β_kS_δ~*的伴随多项式的因式分解定理,进而得到了这类图的补图的色等价性.     

球上同伦群的不变量

<正> §1.设 S~(q+1)为 q+1维球.讨论同伦群 П_r(S~(q+1))时 H.Hopf,G.W.WhiteheadP.J.Hilton 等发展了广义 Hopf 不变量,H:П_r(S~(q+1))→П_r(S~(2q+1)). (1)在同伦群 П_r(S~(q+1))中,差数 r—(q+1)比 П_r(S~(2q+1))中的差数 r—(2q+1)大.在同伦群的计算中差数小的应该先计算,所以通过 Hopf不变量利用差数较小的同伦群表达差数较     

在邊点取極大值的函數的漸近積分

<正> 在其中我們設被積分的大數函數係在D域的某種型式的邊界上取絕對極大值。在早先的一篇文章中,作者曾證明了一個關於此類積分的漸近公式,在該處係假定D域的邊界為歐氏空間R_n中的一個(n—1)維曲面。被積分的大數函     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.