首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 203 毫秒
1.
为了使细分法具有更多可控性,提出一种基于圆平均带参数的非线性细分法.首先介绍一种基于2点及其法向量对的非线性加权平均,即圆平均;然后将线性细分法改写为线性平均的重复binary细分,并用圆平均替代线性平均,得到了新的带参数非线性4点插值细分法和3点逼近细分法;最后分析了新细分法的收敛性、保圆性、C1连续性.数值例子表明,当初始控制多边形的长度变化较大时,利用该细分法产生的极限曲线可以避免自交;同时,参数和初始法向量的选取可有效地控制极限曲线的形状,由曲率变化图可知,该细分法产生的极限曲线比线性4点插值细分法更加光顺.  相似文献   

2.
传统的线性四点插值细分方法不能表示圆等非多项式曲线,为了解决这种 问题,基于几何特性提出了一种带有一个参数的四点插值型曲线细分方法。细分过程中,过 相邻三插值点作圆,过相邻二插值点的圆弧有两个中点,将其加权平均得到新插值点,文中 给出了插值公式和算法描述。所给方法具有还圆性,可以实现保凸性。实例分析对比了本方 法与多种细分方法的差异,说明本方法是有效的,当参数取值较小时,曲线靠近控制多边形。  相似文献   

3.
多数有关细分法的文献侧重于研究细分法的构造、收敛性光滑性分析及其在光滑曲线曲面造型中的应用,少有文献致力于细分参数对细分曲线形状影响的理论分析。首先引入仿射坐标的观点,从几何直观的角度对三点ternary插值细分法中细分参数的几何意义进行研究。接着通过对细分法的C0和C1参数域及新顶点域的等价描述,从理论化的角度对细分参数对细分曲线形状的局部和整体控制作用进行分析,描述它们对细分曲线行为的影响。在给定初始数据的条件下,可通过对形状参数的适当选择来有的放矢地实现对三点ternary插值细分曲线曲面的形状调整和控制。该结果可用于工业领域中产品的外形设计及形状控制。  相似文献   

4.
提出包含两个参数的五点ternary插值细分法。利用生成多项式等方法对细分法的一致收敛性,C K连续性进行了分析。讨论了参数对细分法的收敛性及连续性的影响,同时给出了细分法C0到C2连续的充分条件和数值算例。  相似文献   

5.
为了得到插值与逼近相统一的非静态细分法,根据非静态插值4点细分法和三次指数B-样条细分法之间的联系,构造了3类非静态4点二重混合细分法:基于非静态插值细分的非静态逼近细分法,基于非静态逼近细分的非静态插值细分法,非静态插值与逼近混合细分法.诸多已有的插值细分法和逼近细分法都是所提混合细分法的特例.最后给出了这3类混合细分法的几何解释,分析了其Ck连续性、指数多项式生成性和再生性.数值实例表明,利用文中的混合细分法,通过适当选取参数可以实现对极限曲线的形状控制.  相似文献   

6.
提出一类包含4个参数的六点细分法,它以双参数四点法和三参数六点法作为特殊情况,可以构造光滑插值曲线和光滑逼近曲线,并且可以通过调整4个参数的取值使得曲线达到C4连续。讨论了细分参数对细分法的收敛性及连续性的影响,给出了细分法Ck连续性的充分条件及一些数值算例。  相似文献   

7.
提出一类包含3个参数的6点细分法,它以双参数4点法作为一种特殊情况,可以构造光滑插值曲线和光滑逼近曲线,并且可以通过调整3个参数的取值使得曲线达到C4连续.讨论了参数对细分法的收敛性及连续性的影响,给出了细分法Ck连续性的充分条件及一些数值算例.  相似文献   

8.
提出了一般的三点三重、四点三重逼近细分格式,利用稳定细分格式Ck连续的充要条件,分析了细分法各阶连续时参数的取值范围。利用提出的一般细分法,可以造型光滑逼近曲线;当某些细分参数取特殊值时,还可以用来造型插值曲线。为便于应用,还对Hassan的3点ternary逼近细分法进行了改进,使其带有一个全局张力参数,通过它更易控制曲线的形状。在全局张力参数的一定范围内可以生成C1,C2连续的极限曲线。  相似文献   

9.
提出一种基于顶点法向量约束实现插值的两步Catmull-Clark细分方法.第一步,通过改造型Catmull-Clark细分生成新网格.第二步,通过顶点法向量约束对新网格进行调整.两步细分分别运用渐进迭代方法和拉格朗日乘子法,使得极限曲面插值于初始控制顶点和法向量.实验结果证明了该方法可同时实现插值初始控制顶点和法向量,极限曲面具有较好的造型效果.  相似文献   

10.
提出一种二进制的几何非线性逼近型细分格式。在该格式中,新点不全是旧点的线性组合,其中一个新点是通过在法向量方向偏移所产生,且法向量在每次细分中能自适应计算。引入一些参数来控制细分过程,且参数对曲线形状的影响是局部的。实例证明,通过选择适当的参数值,产生的细分曲线具有保凸性和 连续性。  相似文献   

11.
逼近型细分方法生成的细分曲面其品质要优于插值型细分方法生成的细分曲面.然而,逼近型细分方法生成的细分曲面不能插值于初始控制网格顶点.为使逼近型细分曲面具有插值能力,一般通过求解全局线性方程组,使其插值于网格顶点.当网格顶点较多时,求解线性方程组的计算量很大,因此,难以处理稠密网格.与此不同,在不直接求解线性方程组的情况下,渐进插值方法通过迭代调整控制网格顶点,最终达到插值的效果.渐进插值方法可以处理稠密的任意拓扑网格,生成插值于初始网格顶点的光滑细分曲面.并且经证明,逼近型细分曲面渐进插值具有局部性质,也就是迭代调整初始网格的若干控制顶点,且保持剩余顶点不变,最终生成的极限细分曲面仍插值于初始网格中被调整的那些顶点.这种局部渐进插值性质给形状控制带来了更多的灵活性,并且使得自适应拟合成为可能.实验结果验证了局部渐进插值的形状控制以及自适应拟合能力.  相似文献   

12.
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new non-linear subdivision schemes, face based subdivision scheme and normal based subdivision scheme, are introduced for surface interpolation of triangular meshes. With a given coarse mesh more and more details will be added to the surface when the triangles have been split and refined. Because every intermediate mesh is a piecewise linear approximation to the final surface, the first type of subdivision scheme computes each new vertex as the solution to a least square fitting problem of selected old vertices and their neighboring triangles. Consequently, sharp features as well as smooth regions are generated automatically. For the second type of subdivision, the displacement for every new vertex is computed as a combination of normals at old vertices. By computing the vertex normals adaptively, the limit surface is G1 smooth. The fairness of the interpolating surface can be improved further by using the neighboring faces. Because the new vertices by either of these two schemes depend on the local geometry, but not the vertex valences, the interpolating surface inherits the shape of the initial control mesh more fairly and naturally. Several examples are also presented to show the efficiency of the new algorithms.  相似文献   

13.
Making Doo-Sabin surface interpolation always work over irregular meshes   总被引:1,自引:0,他引:1  
This paper presents a reliable method for constructing a control mesh whose Doo-Sabin subdivision surface interpolates the vertices of a given mesh with arbitrary topology. The method improves on existing techniques in two respects: (1) it is guaranteed to always work for meshes of arbitrary topological type; (2) there is no need to solve a system of linear equations to obtain the control points. Extensions to include normal vector interpolation and/or shape adjustment are also discussed.  相似文献   

14.
Little attention has been paid to estimating dimensions of the curves generated by the subdivision algorithms. A unified method is proposed to estimate the dimension of curves generated by the arbitrary, stationary, linear subdivision schemes with given control points, based on a theorem about the Hausdorff dimension of iterated function systems. Several examples are given to demonstrate the implementation of the method, including the Koch curve, the uniform quadratic B-spline curve and the curves generated by the four-point binary and ternary interpolatory subdivision schemes with a free parameter. Compared with the method of the traditional iterated function system collage theorem, our algorithm overcomes the disadvantage of choosing points and collage, avoiding a large amount of calculation to find the contractive affine transformations and the contraction constants. Furthermore, we can calculate not only the dimension of the special curves with the geometric structure of self-similarity, but also the dimension of the curves generated by more general subdivision algorithms.  相似文献   

15.
构造了一类收敛的多参数差分格式,根据细分格式和差分格式的关系以及连续性条件可得到任意阶连续的多参数曲线细分格式.通过选取合适的参数可以得到一些经典的曲线细分格式,如Chaikin格式、三次样条细分格式和四点插值格式等;同时设计了一种C1连续的不对称三点插值格式,可以生成不对称的极限曲线.给出了同阶差分格式线性组合的性质,从而可设计出更多收敛的多参数曲线细分格式.  相似文献   

16.
蜂窝细分   总被引:9,自引:0,他引:9  
张宏鑫  王国瑾 《软件学报》2002,13(7):1199-1208
给出了一类新颖的基于六边形网络的细分方法,该方法拓广了细分曲面的种类,被形象地称为蜂窝细分法,通过引入中心控制点的概念,使蜂窝细分具有参数选取灵活,形状控制容易,网格复杂性增长缓慢,适用范围广等优点,分析了蜂窝细分方法的极限性质以及参数选取规则,可保证细分曲面处处达到切平面连续,并在适当条件下具有插值能力,该方法适用于动画造型和工业造型设计。  相似文献   

17.
构造了2个混合细分模式,一个是基于三次B样条细分的二分混合细分曲线族;另一个是基于一种三分三点逼近细分的三分混合细分曲线族.通过调整混合参数来控制曲线的收缩与膨胀幅度,利用生成函数技术和特征值方法对这2个带参数的细分模式的连续性进行了严格的理论分析.最后,通过选择合适的混合参数给出了一种曲线保长的动态细分方法.  相似文献   

18.
A new method for constructing a Catmull–Clark subdivision surface (CCSS) that interpolates the vertices of a given mesh with arbitrary topology is presented. The new method handles both open and closed meshes. Normals or derivatives specified at any vertices of the mesh (which can actually be anywhere) can also be interpolated. The construction process is based on the assumption that, in addition to interpolating the vertices of the given mesh, the interpolating surface is also similar to the limit surface of the given mesh. Therefore, construction of the interpolating surface can use information from the given mesh as well as its limit surface. This approach, called similarity based interpolation, gives us more control on the smoothness of the interpolating surface and, consequently, avoids the need of shape fairing in the construction of the interpolating surface. The computation of the interpolating surface’s control mesh follows a new approach, which does not require the resulting global linear system to be solvable. An approximate solution provided by any fast iterative linear system solver is sufficient. Nevertheless, interpolation of the given mesh is guaranteed. This is an important improvement over previous methods because with these features, the new method can handle meshes with large number of vertices efficiently. Although the new method is presented for CCSSs, the concept of similarity based interpolation can be used for other subdivision surfaces as well.  相似文献   

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

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