首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 100 毫秒
1.
提出了一种基于四边形网格的可调细分曲面造型方法。该方法不仅适合闭域拓扑结构,且对初始网格是开域的也能进行处理。细分算法中引入了可调参数,增加了曲面造型的灵活性。在给定初始数据的条件下,曲面造型时可以通过调节参数来控制极限曲面的形状。该方法可以生成C1连续的细分曲面。试验表明该方法生成光滑曲面是有效的。  相似文献   

2.
本文在分析了传统几何造型的弊端及开曲面造型中光滑边界曲线的插值要求后,针对细分曲面造型方法中较常用的Loop细分,提出了基于边界采样技术的插值细分曲面造型方法。该方法一方面利用了细分曲面造型的优点,如算法简单、可表达任意拓扑结构等;另一方面又满足了工程应用中插值边界曲线的要求。文中详细讨论该算法的步骤,并通过示例验证了该算法的有效性和实用性。  相似文献   

3.
将双参数四点细分曲线方法进行推广,提出了基于双参数四点细分法的曲面造型方法,并对其收敛性进行了分析。该方法通过对两个参数的适当调节能够较容易地控制极限曲面的形状,极限曲面能够达到C4连续,可以应用到对曲面的连续性要求较高的曲面造型中去。在给定初始数据的条件下,可通过对形状参数的适当选择来实现对极限曲面的形状调整和控制,试验表明该算法生成光滑曲面是有效的。  相似文献   

4.
Loop型半静态细分方法   总被引:1,自引:1,他引:1  
在拓展四次三方向Box-样条曲面离散定义的基础上,导出了半静态Loop细分方法,并构造了该细分方法的二邻域细分矩阵.通过对细分矩阵特征值的理论分析,证明了文中方法的细分极限曲面收敛且切平面连续.半静态Loop细分方法的细分矩阵随细分次数规则变化,与传统Loop细分方法相比,该方法具有更大的灵活性和更丰富的造型表现能力.  相似文献   

5.
可调自适应三角网格的细分曲面造型方法   总被引:1,自引:0,他引:1  
为了研究一种简单的有效的细分曲面方法使生成的曲面不仅光滑而且可调,提出了一种面向三角网格的可调自适应细分曲面造型法,该方法通过在传统的Loop细分模式中加入形状控制因子以使生成的曲面形状可调,同时引入二面角作为控制误差来判断相邻三角形夹角是否满足给定的阈值,以此实现自适应细分过程。模拟算例结果表明,该方法不仅能用较少网格获得性能良好的曲面,而且可以通过选取不同的值调整生成曲面形状,满足工程需要。  相似文献   

6.
张水波 《福建电脑》2012,28(11):95-96
本文研究了曲面造型中的细分曲面造型方法,分析了细分曲面造型的优点。基于多边形网格的细分方法分析了基于三角形网格1-4分裂的Loop细分模式的优点,并实现了基于Loop细分模式的曲面造型。利用Loop细分模式进行两次细分,得到不同网格密度的数据,最后本文给出了细分前后的点数、边数以及面数,并显示了细分前后的点的效果图。  相似文献   

7.
对细分曲面在曲面造型中的应用进行了研究,并着重于蒙皮曲面造型技术.所提方法在传统的蒙皮曲面构造过程中引入细分方法,有效地避免了因截面曲线的相容性处理而产生的数据量激增的问题;最后生成的蒙皮曲面能够精确插值预先设计的截面曲线,并且可以在指定的截面曲线处产生折痕效果.  相似文献   

8.
对经典的四点细分格式进行推广,提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的四参数四点细分曲线造型方法,并把该方法扩展到曲面上,对其连续性和收敛性进行了分析。把四参数四点细分法运用于山地模拟,由于其中四个参数选取的灵活性,可对生成的地形形状进行适当的调整,生成比较丰富的地貌形状。细分方法具有多尺度特点,所以可对地貌进行细节描述。试验证明能够较好地生成模拟山地地形,为山地地形模拟仿真提供了一种有效的方法。  相似文献   

9.
由于参数曲面(包括B样条和NURBS曲面)的控制多面体局限于规则网格,它们很难被用来造型复杂的三维形体,因而最近很多年,人们把研究兴趣转向了细分曲面,并取得了大量的研究成果,这使得细分曲面成为计算机图形学,CAGD,计算机动画和医学图像处理等领域最引人注目的造型技术。  相似文献   

10.
基于细分曲面的三维服装柔性实体模拟   总被引:4,自引:0,他引:4  
提出一种基于细分曲面的三维服装柔性实体模拟算法,该算法将整个模拟过程分为两个阶段:首先利用四点细分曲面造型方法生成三维服装刚性曲面,然后在刚性曲面基础上通过引入织物的物理模型来模拟三维服装柔性曲面,通过物理和几何模拟方法有机结合,算法有效解决了复杂衣片间的缝合问题,较大地提高了模拟的计算效率,同时,也提出了一种基于细分曲面层次数据结构的碰撞检测算法,有效提高了模拟速度,提出的算法已全部在所开发的三维虚拟服装试衣系统中得以实现,实验结果表明:该算法具有模拟效率高、交互性强和易于计算机实现等优点。  相似文献   

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.
在改进任意拓扑网构造光滑表面时,初始控制网格确定的情况下,生成的曲面形状惟一确定,最终的物体造型也随之确定,不具有可调性,因而在曲面细分过程中引入了控制参数和摄动。通过引入控制参数,调节一个参数值,使得所得的细分曲面的表达度可控,可以得到一系列的细分曲面。引入摄动是为了改进了空间位置,允许局部地调控约束曲面的形状。最后给出了曲面设计的实例,表明这种算法简单、有效。  相似文献   

14.
目前很多细分方法都存在不能用同一种方法处理封闭网格和开放网格的问题。对此,一种新的基于插值技术的LOOP曲面细分方法,其主要思想就是给定一个初始三角网格M,反复生成新的顶点,新顶点是通过其相邻顶点的约束求解得到的,从而构造一个新的控制网格M,在取极限的情况下,可以证明插值过程是收敛的;因为生成新顶点使用的是与其相连顶点的约束求解得到的,本质上是一种局部方法,所以,该方法很容易定义。它在本地方法和全局方法中都有优势,能处理任意顶点数量和任意拓扑结构的网格,从而产生一个光滑的曲面并忠实于给定曲面的形状,其控制  相似文献   

15.
本文以非均匀Catmull-Clark细分模式下的轮廓删除法为基础,通过在细分网格中定义模板并调整细分网格的顶点位置,为非均匀B样条曲面顶点及法向插值给出了一个有效的方法.该细分网格由待插顶点形成的网格细分少数几次而获得.细分网格的顶点被分为模板内的顶点和自由顶点.各个模板内的顶点通过构造优化模型并求解进行调整,自由顶点用能量优化法确定.这一方法不仅避免了求解线性方程组得到控制顶点的过程,而且在调整顶点的同时也兼顾了曲面的光顺性.  相似文献   

16.
In this paper, we introduce triangular subdivision operators which are composed of a refinement operator and several averaging operators, where the refinement operator splits each triangle uniformly into four congruent triangles and in each averaging operation, every vertex will be replaced by a convex combination of itself and its neighboring vertices. These operators form an infinite class of triangular subdivision schemes including Loop's algorithm with a restricted parameter range and the midpoint schemes for triangular meshes. We analyze the smoothness of the resulting subdivision surfaces at their regular and extraordinary points by generalizing an established technique for analyzing midpoint subdivision on quadrilateral meshes. General triangular midpoint subdivision surfaces are smooth at all regular points and they are also smooth at extraordinary points under certain conditions. We show some general triangular subdivision surfaces and compare them with Loop subdivision surfaces.  相似文献   

17.
针对Loop 细分无法调整形状与不能插值的问题,提出了一种形状可调的Loop 细分 曲面渐进插值方法。首先给出了一个既能对细分网格顶点统一调整又便于引入权因子实现细分曲 面形状可调的等价Loop 细分模板。其次,通过渐进迭代调整初始控制网格顶点生成新网格,运 用本文的两步Loop 细分方法对新网格进行细分,得到插值于初始控制顶点的形状可调的Loop 细分曲面。最后,证明了该方法的收敛性,并给出实例验证了该方法的有效性。  相似文献   

18.
Loop and Catmull-Clark are the most famous approximation subdivision schemes, but their limit surfaces do not interpolate the vertices of the given mesh. Progressive-iterative approximation (PIA) is an efficient method for data interpolation and has a wide range of applications in many fields such as subdivision surface fitting, parametric curve and surface fitting among others. However, the convergence rate of classical PIA is slow. In this paper, we present a new and fast PIA format for constructing interpolation subdivision surface that interpolates the vertices of a mesh with arbitrary topology. The proposed method, named Conjugate-Gradient Progressive-Iterative Approximation (CG-PIA), is based on the Conjugate-Gradient Iterative algorithm and the Progressive Iterative Approximation (PIA) algorithm. The method is presented using Loop and Catmull-Clark subdivision surfaces. CG-PIA preserves the features of the classical PIA method, such as the advantages of both the local and global scheme and resemblance with the given mesh. Moreover, CG-PIA has the following features. 1) It has a faster convergence rate compared with the classical PIA and W-PIA. 2) CG-PIA avoids the selection of weights compared with W-PIA. 3) CG-PIA does not need to modify the subdivision schemes compared with other methods with fairness measure. Numerous examples for Loop and Catmull-Clark subdivision surfaces are provided in this paper to demonstrate the efficiency and effectiveness of CG-PIA.  相似文献   

19.
The quad/triangular subdivision, whose control net and refined meshes consist of both quads and triangles, provides better visual quality of subdivision surfaces. While some theoretical results such as polynomial reproduction and smoothness analysis of quad/triangle schemes have been obtained in the literature, some issues such as the basis functions at quad/triangle vertices and design of interpolatory quad/triangle schemes need further study. In our study of quad/triangle schemes, we observe that a quad/triangle subdivision scheme can be derived from a nonhomogeneous refinement equation. Hence, the basis functions at quad/triangle vertices are shifts of the refinable function associated with a nonhomogeneous refinement equation. In this paper a quad/triangle subdivision surface is expressed analytically as the linear combination of these basis functions and the polynomial reproduction of matrix-valued quad/triangle schemes is studied. The result on polynomial reproduction achieved here is critical for the smoothness analysis and construction of matrix-valued quad/triangle schemes. Several new schemes are also constructed.  相似文献   

20.
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Although our method can be applied to B-spline surfaces and subdivision surfaces of all kinds, we illustrate our algorithm focusing on Loop subdivision surfaces as most of the meshes are in triangular form. We start our algorithm by assuming that the given triangular mesh is a control net of a Loop subdivision surface. The control points are iteratively updated globally by a simple local point-surface distance computation and an offsetting procedure without solving a linear system. The complexity of our algorithm is O(mn) where n is the number of vertices and m is the number of iterations. The number of iterations m depends on the fineness of the mesh and accuracy required.  相似文献   

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

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