三维网格曲面的可展性优化算法

可展曲面是每点高斯曲率均为0的曲面,具有许多良好的性质,因此在工业中具有很多应用.将一般的曲面用可展曲面来逼近表示具有现实意义.以此为目的,文中设计了一个有效的算法来处理一般的曲面,使得处理后的曲面尽可能满足可展的性质,同时与初始的曲面尽量地接近.首先利用最小范数方法来对网格曲面进行处理,得到初始预测的网格曲面.初始预测曲面具有良好的可展性,但是不能较好地保持网格的局部结构.然后利用尽可能刚性(As-rigid-as-possible)的方法,在初始预测曲面的基础上进行修正得到新的网格曲面.为了保持局部结构,作者的方法可以是基于顶点邻域的,也可以是基于三角形的.这两个过程可以迭代进行,直至得到满足要求的结果.与以往的算法相比,文中算法能保证结果收敛,迭代次数更少,且能得到更好的结果.     

A fully geometric approach for developable cloth deformation simulation

We present a new method for simulation of inextensible cloth subjected to a conservative force (e.g., the gravity) and collision-free constraint. Traditional algorithms for cloth simulation are all physically-based in which cloth is treated as an elastic material with some stiffness coefficient(s). These algorithms break down ultimately if one tries to set this stiffness coefficient to infinite which corresponds to inextensible cloth. The crux of the method is an algorithm for interpolating a given set of arbitrary points or space curves by a smooth developable mesh surface. We formulate this interpolation problem as a mesh deformation process that transforms an initial developable mesh surface, e.g., a planar figure, to a final mesh surface that interpolates the given points (called anchor points). During the deformation process, all the triangle elements in the intermediate meshes are kept isometric to their initial shapes, while the potential energy due to the conservative force is reduced gradually. The collision problem is resolved by introducing dynamic anchor points owing to the collision during the deformation. Notwithstanding its simplicity, the proposed method has shown some promising efficacy for simulation of inextensible cloth.     

一种提取可展网格曲面的新方法

可展曲面是每一点高斯曲率为零的曲面,由于其具有优良性质,因此在工程实践中得到广泛应用。为便于各种网格处理,从一个整体表面网格模型中获取可展区域具有重要意义。针对目前相关方法中存在的不足,本文提出了一个提取可展网格面片的新方法。首先利用高斯曲率提取可展网格面片,接着对分割得到的层可展区域进行微分几何上的直纹面的拟合,然后根据拟合的直纹面方程来判断是否可展,最后根据每种可展类型的直母线性质来判定可展类型。获得的可展面片中包括连续柱面和连续锥面,而传统方法无法获得;另外,确定获得面片的可展类型便于下一步网格处理。与已有方法相比,此方法更具有可行性和优越性。     

基于四面体控制网格的模型变形算法

提出一种鲁棒的保体积保表面细节的模型变形算法.首先将输入模型嵌入到一个稀疏的四面体控制网格中,并且通过一种改进的重心坐标来建立两者的对应关系;然后通过用户的交互,对控制网格建立一个二次非线性能量函数对其进行变形,而输入模型的变形结果则可以通过插值来直接获得.由于能量函数的优化是在控制网格上进行的,从而大大提高了算法的效率.与此同时,提出一种新的能量--Laplacian能量,可以使四面体控制网格进行尽量刚性的变形,从而有效地防止了大尺度编辑过程中模型形状的退化现象.文中算法还具有通用性,可支持多种模型的表示方式,如三角网格模型、点模型等.实验结果表明,该算法可以有效地保持输入模型的几何细节、防止明显的体积变化,得到了令人满意的结果.     

网格模型的局部编辑算法

提出一种新的网格模型局部编辑算法，该算法可以精确地控制变形区域的大小、边界和变形点的位移，克服了FFD及其改进算法的缺点．首先交互地定义一个附着在模型表面的控制网格；然后建立模型变形区域与控制网格间点的映射，再依据变形要求来编辑控制网格；最后根据映射关系反算出模型变形区域点的新位置．控制网格可以是参数曲面的控制网格，也可采用一般三角网格或预先定义的网格模板．为达到精确变形的目的，对模型与控制网格重叠的区域进行自适应细分．该算法计算简便、易于实现，并能达到很好的效果．     

拓扑最优的可展网格曲面放样建模

在服装、制鞋、钣金等行业的产品外形设计中,经常需要插值多条特征空间曲线,构建可展曲面 (可无伸缩地展开成平面)。针对这一问题,基于Dijkstra算法提出了一种新的放样建模算法：给定多条参数曲线,经过自适应离散后,寻找一个全局拓扑最优的可展网格放样曲面（针对不同的目标曲面能量,同样可以产生目标能量定义的拓扑最优的放样网格曲面）。该问题最终可转化为有向无环图(DAG)的单源最短路径的求解,算法的时间复杂度为O(N log N),其中N为搜寻空间。测试结果表明该算法在相关行业的放样外形设计方面具有实际工程应用价值。     

可展Bézier曲面的设计

通过引入移位算子,利用de Casteljau算法,得到了可展Bézier直纹面是单参数平面族的包络的结论,并简洁地导出了两条边界曲线分别为n次和m次的空间Bézier曲线的直纹面为可展曲面的充分必要条件。提出了二次Bézier可展曲面的设计方法：给定可展曲面的4个角点a0、b0、a2、b2和两个自由设计参数?姿、?滋,则待求的2个控制顶点a1、b1是在前2个控制顶点a0、b0的线性插值点a*与后2个控制顶点a2、b2的线性插值点b*的连线上,并且也是a*、b*这2个线性插值点的线性插值,即这4点a*、a1、b1、b*共线。该设计方法简单,可以通过2个自由设计参数?姿、?滋方便地控制曲面的形状。实例说明设计效果良好。     

网格修补的特征配准方法

目的 网格重建和编辑会产生几何特征缺失的模型,填补这些空洞具有重要的意义。为了克服复杂曲面修补中网格融合难以配准的问题,提出了环驱动球坐标结合基于曲率及法向ICP(iterative closest point)迭代配准的网格修补方法。方法 首先用户查找合适的源网格面片放入空洞处周围;然后对目标网格空洞环建立B样条曲线,将带修补网格包边界置于B样条曲线上,构架环驱动球坐标,将源网格变形初步配准目标网格空洞周围领域;最后使用Laplacian光顺并基于网格曲率及法向进行ICP迭代配准,使源网格与目标网格光滑拼接融合。结果 该方法能够有效修补网格空洞缺失的细节特征,并且拼接处光滑连续。 结论 环驱动球坐标配准避免了网格变形的包围网格笼子构造,再通过ICP迭代精确配准网格,和以往的网格修补方法相比,该方法能够很好地修补网格空洞处细节特征。     

Developable polynomial surface approximation to smooth surfaces for fabrication parameters of a large curved shell plate by Differential Evolution

This paper presents a simple and efficient method to approximate a developable surface to a compound design surface by a polynomial. It is required to predict a final shape of roll bending in the fabrication of a curved shell plate. The roll bending process usually makes the cylindrical or conical curvature from an initial flat plate. It means that the final shape is developable or the surface representation has zero Gaussian curvature. The fabrication shape is important in order to estimate process parameters of roller bending.An optimization problem is formulated to determine the polynomial surface which is in the closest proximity to the design surface or the given shell plate, which is subjected to developability. The results and the efficiency of this algorithm are verified and evaluated by applying it to some shell plates which are obtained from a real ship model. The predicted bending shape becomes fundamental information in determining more process parameters for the fabrication of a compound curved shell plate.     

网格图形编辑的样条方法

提出基于样条的网格图形编辑方法,首先在网格表面附近构建近似的样条曲面,同时预计算网格顶点在样条上的对应点处局部标架下的坐标表示,并作为不变量在变形中进行保持;然后编辑样条的位置和形状,利用局部标架和细节坐标重建变形后的网格,同时进行网格光滑和网格细分,改善变形效果,以实现复杂模型简单快捷的编辑/变形.方法在保细节的同时允许对网格在多个尺度下编辑.实验结果表明,融合了样条的三角网格方法较传统的样条编辑方法可避免产生过多的控制点,大大地简化了操作.     

Nonuniform B-spline Mesh Fairing Method

A method for fairing a surface composed of a set of discrete data points distributed in anonrectangular topological mesh is presented.All curves are expressed by nonuniform cubic B-splinecurves.The fairing method is minimizing the elastic strain energy of mesh curves and of springs at-tached to the data points.The fairing surface can be generated by interpolating through the meshcurves.The generation and fairing of a ship hull surface is given as an example.     

基于Hermite插值的网格拼接和融合

网格模型的拼接和融合是3维形状编辑和造型中的一个重要方面。基于Hermite插值技术,提出一种适用于具有一般边界点空间分布的三角网格模型之间无缝光滑拼接和融合方法。首先查找网格模型待拼接区域的边缘点集,并利用二次B样条曲线插值边缘点集分别得到边缘曲线;然后对边缘曲线进行Hermite插值得到拼接区域连续曲面;最后对拼接曲面分别进行三角网格化和Laplacian光顺平滑处理以实现网格模型的光滑拼接和融合。由于利用B样条曲线插值待拼接模型边界,本文方法适用于具有各种不同边界情形的网格模型拼接和融合,它不仅仅可以处理平面边界曲线情形也可以处理空间边界曲线情形。结合Hermite曲面插值拼接过渡区域,使得产生的拼接网格能光滑地衔接待拼接模型。实验结果表明,本文方法能够有效地实现三角网格模型的光滑拼接、模型修复和模型融合。     

Mesh deformation using radial basis functions for gradient-based aerodynamic shape optimization

Gradient-based aerodynamic shape optimization using computational fluid dynamics (CFD), and time dependent problems in aeroelasticity, that is, coupled calculations between computational structural mechanics (CSM) and CFD, require repeated deformations of the CFD mesh.An interpolation scheme, based on radial basis functions (RBF), is devised in order to propagate the deformations from the boundaries to the interior of the CFD mesh. This method can lower the computational costs due to the deformation of the mesh, in comparison with the usual Laplace smoothing. Moreover, the algorithm is independent of the mesh connectivities. Therefore, structured and unstructured meshes are equally treated as well as hybrid meshes.The application of this interpolation scheme in problems of aerodynamic shape optimization is also carefully investigated. When the optimization is executed by a gradient-based algorithm the cost function is differentiated with respect to the design parameters in order to obtain the gradient. The gradient is most efficiently and accurately calculated by solving a certain adjoint equation derived from the discretized flow equations. The calculation of the gradient, which is detailed in this presentation, involves the Jacobian matrix of the mesh deformation.Finally, we present the results of an optimization of the ONERA M6 wing at transonic speed using the interpolation algorithm. The results are used for comparison with another technique of mesh deformation. The quality of the mesh obtained by the new algorithm, and the interpolation error, are analyzed with respect to the parameters of the interpolation scheme: the type of RBF, the RBF’s shape parameter, and the sets of control points.     

可调表面上的曲线插值

提出一个带有多特征的曲线插值可调表面算法。引入形状相似形参数,拓扑地修改初始控制网格。这样使得满足曲线插值的同时,结果表面与初始控制网格有不同的相似性;引入双边控制调节参数,更新插值曲线两边位置,调节插值曲线的弯曲程度;形成求解满足控制曲率的公式。实验结果表明此算法使得曲线插值在可调表面上可行,能够表现出多样性。     

基于Hermite插值的网格拼接和融合-CIDE2013

网格模型的拼接和融合是3维形状编辑和造型中的一个重要方面。基于Hermite插值技术,提出了一种适用于具有一般边界点空间分布的三角网格模型之间无缝光滑拼接和融合方法。首先查找网格模型待拼接区域的边缘点集,并利用二次B样条曲线插值边缘点集分别得到边缘曲线;然后对边缘曲线进行Hermite插值得到拼接区域连续曲面;最后对拼接曲面分别进行三角网格化和Laplacian光顺平滑处理以实现网格模型的光滑拼接和融合。由于利用B样条曲线插值待拼接模型边界,本文方法适用于具有各种不同边界情形的网格模型拼接和融合,它不仅仅可以处理平面边界曲线情形也可以处理空间边界曲线情形。结合Hermite曲面插值拼接过渡区域,使得产生的拼接网格能光滑地衔接待拼接模型。实验结果表明,本文方法能够有效地实现三角网格模型的光滑拼接、模型修复和模型融合。     

插值曲率线的直纹面可展设计

目的 曲率线在微分几何中起着非常重要的作用,它在曲面分析中是一个很有用的工具。可展曲面是曲面造型中最简单也最常用的一类曲面,目前大部分工作都是研究在给定曲面上寻找或者计算曲率线,而其反问题研究工作较少,为此,提出一种插值曲率线的可展曲面构造方法,并进一步将它应用到曲面造型中。方法 利用Frenet标架表示直纹面的母线,根据曲线为曲面曲率线以及曲面可展的充要条件,得到直纹面的母线需要满足的关系式。并引入控制函数控制曲面的形状。结果 给出了以给定曲线为曲率线的直纹面可展的具体表达式,根据可展曲面分类分析了设计曲面为柱面、锥面和空间曲线切线面的充要条件,并给出了两个代表性的实例验证该方法的有效性,实例结果表明,该方法不仅适用于一般参数曲线,对分段参数曲线也是有效的。结论 利用构造性的方法给出了插值曲率线的可展曲面的具体表达形式,并通过具体实例验证了该方法的有效性。     

Drawing on air: input techniques for controlled 3D line illustration

Stretch-free surface flattening has been requested by a variety of applications. At present, the most difficult problem is how to segment a given model into nearly developable atlases so that a nearly stretch-free flattening can be computed. The criterion for segmentation is needed to evaluate the possibility of flattening a given surface patch, which should be fast computed. In this paper, we present a method to compute the length-preserved free boundary (LPFB) of a mesh patch, which speeds up the mesh parameterization. The distortion on parameterization can then be employed as the criterion in a trial-and-error algorithm for segmenting a given model into nearly developable atlases. The computation of LPFB is formulated as a numerical optimization problem in the angle space, where we are trying to optimize the angle excesses on the boundary while preserving the constraints derived from the closed-path theorem and the length preservation.     

Computing length-preserved free boundary for quasi-developable mesh segmentation

Stretch-free surface flattening has been requested by a variety of applications. At present, the most difficult problem is how to segment a given model into nearly developable atlases so that a nearly stretch-free flattening can be computed. The criterion for segmentation is needed to evaluate the possibility of flattening a given surface patch, which should be fast computed. In this paper, we present a method to compute the length-preserved free boundary (LPFB) of a mesh patch which speeds up the mesh parameterization. The distortion on parameterization can then be employed as the criterion in a trial-and-error algorithm for segmenting a given model into nearly developable atlases. The computation of LPFB is formulated as a numerical optimization problem in the angle space, where we are trying to optimize the angle excesses on the boundary while preserving the constraints derived from the closed-path theorem and the length preservation.     

三角形网格模型顶点曲率的求解算法*

推导了一般三角形网格模型顶点的平均曲率、高斯曲率和主曲率的计算方法,考虑到经常遇到粗糙三角形网格模型,为提高其曲率计算方法的精度,结合Loop细分曲面算法,进一步拓展了该曲率计算方法.该算法用于具有特征保持的网格模型简化取得了良好的效果.     

G2 quasi-developable Bezier surface interpolation of two space curves

Surface development is used in many manufacturing planning operations, e.g., for garments, ships and automobiles. However, most freeform surfaces used in design are not developable, and therefore the developed patterns are not isometric to the original design surface. In some domains, the CAD model is created by interpolating two given space curves. In this paper, we propose a method to obtain a G² quasi-developable Bezier surface interpolating two arbitrary space curves. The given curves are first split into a number of piecewise Bezier curves and elemental Bezier patches each of which passes through four splitting points are constructed. All neighboring elemental patches are G² connected and they are assembled optimally in terms of the degree of developability (the integral Gaussian curvature). Experiments show that the final composite Bezier surface is superior to a lofted one which is defined regardless of the final surface developability.