首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
三次B样条曲线是一种广泛应用于计算机辅助几何设计中的非常重要的曲线.本文在以曲线的最小应变能作为衡量曲线光顺性的基础上,采用带调节控制参数的方法分别对三次B样条曲线和双三次B样条曲面进行了光顺处理.由所提供的方法以及实例可以看出,本方法可在曲线曲面光顺的基础上通过修改参数大小以达到控制曲线曲面形状的目的,且修改后的点的位置与原坏点的距离是由参数的大小控制决定的,这样就使得我们的光顺处理可以控制在数据测量的误差范围内.  相似文献   

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

3.
T-B样条曲线及其应用   总被引:9,自引:0,他引:9  
给出一种基于三角函数的类B样条设计方法,称其为 T B样条,它具有 B样条曲线曲面的主要优点,它还能够无需有理形式即可精确表示圆弧、椭圆弧等二次曲线弧以及球面、椭球面等二次曲面片.  相似文献   

4.
多尺度B样条小波边缘检测算子   总被引:4,自引:0,他引:4       下载免费PDF全文
基于B样条理论提出了一类新的多尺度小波变换,通过其零交叉或模极值能有效地表示和检测信号或图象的边缘,对任意n次B样条,导出了相应的分解和重建的快速算法,对应的用于分解和重建的滤波器的时域和频域响应也被精确地给出.从时频局部化的角度对不同次数的B样条作了分析,认为3次B样条小波在边缘提取等实际应用中是渐近最优的,结果也为B样条小波在立体视觉匹配、滤噪等方面的进一步应用提供了基础.  相似文献   

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

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

7.
二元三方向剖分中B样条的B网结构与递推算法   总被引:2,自引:0,他引:2  
孙家昶 《计算数学》1990,12(4):365-375
§1.引言众所周知,de Boor-Con递推公式及微分-差分公式对于一元B样条的理论和应用极为重要。在多元样条中是否存在类似的结果,已成为近年来的研究课题。本文从B网结构出发,讨论三向剖分下不同次数样条空间的B样条之间的递推关系,指出不能简单地把函数形式的de Boor-Con公式搬到这里,然而可以在B网意义下实现递推。与一  相似文献   

8.
1 引言和辅助引理 关于样条插值的渐近展开,目前已有许多工作,这些工作主要限于周期样条插值和基样条(cardinal spline)插值情形,它们不仅给出了插值误差的渐近展开,而且获得了逐项渐近展开。对于实际中应用最多的有限区间上的样条插值的渐近展开问题,由于受端点条件的影响,呈现十分复杂的局面。目前的工作只是获得了渐近展开结果,并未获得逐项渐近展开,且主要针对二、三次这类低次样条插值情形,考虑高次样条有良好的逼近性质,特别是其中四、五次样条插值在实际应用中被广泛采用,本文致力于研究四次样条插值问题,获得了其误差  相似文献   

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

10.
周叔子 《计算数学》1989,11(2):132-139
本文讨论薄板弯曲自由边界问题的样条有限元法,对障碍问题和“弹塑性”弯曲问题,采用三次B样条元及二次多结点Hermite元,比较其优劣,证明离散解的收敛性.  相似文献   

11.
Isogeometric analysis using NURBS (Non-Uniform Rational B-Splines) as basis functions gives accurate representation of the geometry and the solution but it is not well suited for local refinement. In this paper, we use the polynomial splines over hierarchical T-meshes (PHT-splines) to construct basis functions which not only share the nice smoothness properties as the B-splines, but also allow us to effectively refine meshes locally. We develop a residual-based a posteriori error estimate for the finite element discretization of elliptic equations using PHT-splines basis functions and study their approximation properties. In addition, we conduct numerical experiments to verify the theory and to demonstrate the effectiveness of the error estimate and the high order approximations provided by the numerical solution.  相似文献   

12.
Isogeometric analysis using NURBS (Non-Uniform Rational B-Splines) as basis functions gives accurate representation of the geometry and the solution but it is not well suited for local refinement. In this paper, we use the polynomial splines over hierarchical T-meshes (PHT-splines) to construct basis functions which not only share the nice smoothness properties as the B-splines, but also allow us to effectively refine meshes locally. We develop a residual-based a posteriori error estimate for the finite element discretization of elliptic equations using PHT-splines basis functions and study their approximation properties. In addition, we conduct numerical experiments to verify the theory and to demonstrate the effectiveness of the error estimate and the high order approximations provided by the numerical solution.  相似文献   

13.
The T-meshes are local modification of rectangular meshes which allow T-junctions. The splines over T-meshes are involved in many fields, such as finite element methods, CAGD etc. The dimension of a spline space is a basic problem for the theories and applications of splines. However, the problem of determining the dimension of a spline space is difficult since it heavily depends on the geometric properties of the partition. In many cases, the dimension is unstable. In this paper, we study the instability in the dimensions of spline spaces over T-meshes by using the smoothing cofactor-conformality method. The modified dimension formulas of spline spaces over T-meshes with T-cycles are also presented. Moreover, some examples are given to illustrate the instability in the dimensions of the spline spaces over some special meshes.  相似文献   

14.
Isogeometric analysis (IGA) with the polynomial splines over hierarchical T-meshes (PHT-splines) is used to provide an efficient tool capable of carrying out the vibration and buckling analyses of the stiffened laminates. IGA offers increased accuracy and efficiency using the PHT-splines, which represent exact geometry of the stiffeners and make the refinement more flexible near the areas where the stiffeners and composite plate are connected. Numerical examples are given to validate the correctness and superiority of the present method, comparing with the results from existing literatures and commercial softwares. Besides, the influences of the orientation, curvature, location and cross-section size of the stiffeners on the natural frequencies and buckling loads are also studied. The results show that the optimization of the shape and size of the stiffeners has an important effect on the vibration and buckling characteristics of stiffened laminates.  相似文献   

15.
The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.  相似文献   

16.
The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.  相似文献   

17.
Functions being piecewise in Ker (D k DpD) are a special case of Chebyshev splines having one nontrivial weight and also a special case of singular splines. An algorithm is designed which enables calculating with related B-splines and their derivatives. Ifp(t) is approximated by a piecewise constant, an interesting recurrence for calculating with polynomial B-splines is obtained.  相似文献   

18.
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.  相似文献   

19.
T-meshes are a type of rectangular partitions of planar domains which allow hanging vertices. Because of the special structure of T-meshes, adaptive local refinement is possible for splines defined on this type of meshes, which provides a solution for the defect of NURBS. In this paper, we generalize the definitions to the three-dimensional (3D) case and discuss a fundamental problem – the dimension of trivariate spline spaces on 3D T-meshes. We focus on a special case where splines are C d?1 continuous for degree d. The smoothing cofactor method for trivariate splines is explored for this situation. We obtain a general dimension formula and present lower and upper bounds for the dimension. At last, we introduce a type of 3D T-meshes, where we can give an explicit dimension formula.  相似文献   

20.
韩国强 《计算数学》1989,11(2):212-219
在实际问题中,尤其是统计问题,碰到的不一定是点态插值,而是要满足某种平均泛函条件.本文讨论算子样条积分平均插值,给出一种新的、计算稳定的求解算法.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号