多裁剪自由曲面生成有限元网格的实现

论述了多裁剪自由曲面生成有限元曲面网格的几个关键技术.采用了推进波前法生成曲面网格,给出了核心算法;在曲面算法中运用了介于参数法与直接法之间的新方法.针对求解曲面上最优点的参数域反算问题,引入了切矢逆求方法,可使迭代次数大为降低.测试表明,该算法快速、稳定.对大型的多裁剪自由曲面生成的曲面有限元网格,可直接用于有限元计算.     

有限元网格的孔洞修补算法研究

针对板料成形零件的有限元网格模型提出了一种基于曲面的网格孔洞修补算法,该算法首先建立有限元网格模型的孔洞边界信息,其次利用网格孔洞边界和单元信息确定截面线的方向并生成截面线,然后用蒙皮法构造光滑的蒙皮曲面,最后利用基于边界约束的铺砌算法生成混合网格的孔洞网格,根据此算法获得的孔洞网格可以与原有网格光滑地融为一体,可以很好地满足板料成形CAE分析零件的网格孔洞修补要求,应用实践表明该算法是稳定可靠的。     

有限元四边单元网格模型的参数化重建

不同于已有的从CAD模型出发构建体参数化模型的思路,为了进行等几何分析,从二维有限元四边单元网格模型出发,重建该网格模型对应的参数化模型.首先利用现有CAE软件生成有限元四边单元网格模型;然后进行网格预处理提取单元之间的拓扑信息,并依据规则实现网格单元规范合并、子域自适应合并、子域边界生成等操作,生成多个零亏格四边子域;最后利用边界插值算法和内点优化算法实现子域参数化.通过多个实例验证了文中算法的有效性;为有限元网格到体参数化模型的转换提供了技术支持,进而为实现海量的CAE模型参数化及其等几何分析提供了一条便捷的途径.     

基于黎曼度量的复杂参数曲面有限元网格生成方法

给出了三维空间的黎曼度量和曲面自身的黎曼度量相结合的三维复杂参数曲面自适应网格生成的改进波前推进算法.详细阐述了曲面参数域上任意一点的黎曼度量的计算和插值方法;采用可细化的栅格作为背景网格,在降低了程序实现的难度的同时提高了网格生成的速度;提出按层推进和按最短边推进相结合的方法,在保证边界网格质量的同时,提高曲面内部网格的质量.三维自适应黎曼度量的引入,提高了算法剖分复杂曲面的自适应性.算例表明,该算法对复杂曲面能够生成高质量的网格,而且整个算法具有很好的时间特性和可靠性.     

基于车身曲面离散点的三角形网格生成

基于车身曲面的离散点,文章利用稀疏阵法搜寻法来自动生成三角形曲面。该方法首先通过曲面离散点在投影面上的投影点来生成稀疏矩阵,接着利用环形边表和边界搜寻盒来进行离散点的自动三角化。该方法算法简单,生成三角形的速度快,且生成的三角形网格适用于有限元分析和车身曲面的反求问题。文章最后给出的具体算例证明了该算法的有效性。     

复杂曲面混合网格的生成算法

有限元网格质量的好坏对金属成形模拟的精度和效率有很大影响。提出了一种复杂曲面混合网格自动生成算法，该算法根据所要划分的网格密度形成初始化边界节点，逐步向内铺砌混合网格，直至布满整个区域。应用实践表明．该算法具有稳定、准确和速度快的特点，生成的网格在相邻曲面边界处不会产生裂缝与覆盖，很好地满足了金属成形模拟分析软件对网格划分的要求。     

边界优先的Delaunay-层推进曲面四边形网格生成

为了提高复杂组合曲面四边形网格生成的鲁棒性和边界单元质量,提出一种边界优先的Delaunay-层推进网格生成方法.首先在剖分域内粗的约束Delaunay背景网格的辅助下,以物理域的位置偏差为引导,在参数域中迭代计算边界点的法矢量;然后结合层推进策略,在几何特征附近生成各向异性或各向同性正交网格;最后使用Coring技术加速内部网格的生成并进行单元合并,得到四边形为主的网格.若干复杂平面区域和组合曲面模型的剖分结果表明,所提方法可生成等角扭曲度和纵横比优于主流商业软件的网格;在12个线程的PC平台上,使用OpenMP并行剖分包含21 772张曲面的引擎模型只用了38.68 s.     

复杂曲面上的四边形网格生成方法

提出了一种曲面上全四边形网格的生成方法。该方法从曲面的边界开始,向内逐个生成单元,利用曲面的局部形状特征控制单元的尺寸,这样可以适应复杂的边界形状,通用性较强。文中介绍了算法的基本思想,提出了多个曲面相邻情况下边界上节点的生成以及一个新的节点环冲突检测方法,最后给出了两个网格生成的实例。     

闭合三角网格的优化切割与保角映射

提出一种自动地将任意闭合三角网格切开并保角映射到二维平面域的算法.通过对自动提取的模型初始切割线逐步优化得到模型切割线,优化过程由一个与保角映射扭曲度和合法性相关的成本函数控制.为了减小映射扭曲,算法中不预先固定参数域边界,而在参数化过程中自动地确定网格的自然边界.实验结果表明,该算法通过优化切割线和参数域边界有效地降低了三角形形状扭曲,并保证了参数化结果的合法性.     

检索矩形结构化网格中裁剪单元的数值算法

裁剪等几何分析的首要任务就是检索出裁剪曲面中的裁剪单元,为此提出一种快速检索矩形结构化网格中裁剪单元的数值算法.首先将网格中每个单元的边界划分为12段区间;然后在剪裁曲线上选取适当的参数点,并将得到的离散曲线代替原剪裁曲线,对矩形结构化网格进行剪裁;根据离散剪裁曲线与单元边界交点位置的不同,将裁剪单元划分为156种不同的类型.该算法还可以根据不同情况来获取剪裁曲线上的点,当采用闭合逆时针矩形剪裁曲线对裁剪NURBS曲面参数网格进行剪裁时,该算法能够快速、有效地检索到裁剪单元,并得到剪裁曲线曲率变化大的点以及裁剪单元在物理空间中的像;悬臂梁的最优拓扑结构算例证明了该算法能够快速、有效地检索出任意矩形结构化网格中的裁剪单元.     

Optimization of passive microwave devices through geometrical parameterization—Application to the design of a cylindrical dual‐mode cavity filter

A new algorithm, based on geometrical parameterization and finite element method is presented for the optimization of microwave devices. Using geometrical parameterization, the field quantities are expressed as a polynomial in design parameters. Automatic differentiation is used for calculation of higher order derivatives. To ensure continuous gradients, an integrated mesh deformation algorithm is deployed to morph initial finite elements mesh into the perturbed geometry. The resulting parametric model is deployed through quadratic surface reconstruction to find local minimum at each stage. The convergence of the optimization through the reconstructed surfaces is discussed. As an example, a 5‐pole dual‐mode cavity filter is designed and optimized using the presented algorithm. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.     

Surface mesh regeneration considering curvatures

This work describes an automatic algorithm for unstructured mesh regeneration on arbitrarily shaped three-dimensional surfaces. The arbitrary surface may be: a triangulated mesh, a set of points, or an analytical surface (such as a collection of NURBS patches). To be generic, the algorithm works directly in Cartesian coordinates, as opposed to generating the mesh in parametric space, which might not be available in all the cases. In addition, the algorithm requires the implementation of three generic functions that abstractly represent the supporting surface. The first, given a point location, returns the desired characteristic size of a triangular element at this position. The second method, given the current edge in the boundary-contraction algorithm, locates the ideal apex point that forms a triangle with this edge. And the third method, given a point in space and a projection direction, returns the closest point on the geometrical supporting surface. This work also describes the implementation of these three methods to re-mesh an existing triangulated mesh that might present regions of high curvature. In this implementation, the only information about the surface geometry is a set of triangles. In order to test the efficiency of the proposed algorithm of surface mesh generation and implementation of the three abstract methods, results of performance and quality of generated triangular element examples are presented.     

Generation of triangular mesh with specified size by circle packing

This paper describes an algorithm for the generation of a finite element mesh with a specified element size over an unbound 2D domain using the advancing front circle packing technique. Unlike the conventional frontal method, the procedure does not start from the object boundary but starts from a convenient point within the open domain. As soon as a circle is added to the generation front, triangular elements are directly generated by properly connecting frontal segments with the centre of the new circle. Circles are packed closely and in contact with the existing circles by an iterative procedure according to the specified size control function. In contrast to other mesh generation schemes, the domain boundary is not considered in the process of circle packing, this reduces a lot of geometrical checks for intersection between frontal segments. If the mesh generation of a physical object is required, the object boundary can be introduced. The boundary recovery procedure is fast and robust by tracing neighbours of triangular elements. The finite element mesh generated by circle packing can also be used through a mapping process to produce parametric surface meshes of the required characteristics. The sizes of circles in the pack are controlled by the principal surface curvatures. Five examples are given to show the effectiveness and robustness of mesh generation and the application of circle packing to mesh generation over curved surfaces.     

Generation of a finite element MESH from stereolithography (STL) files

The aim of the method proposed here is to show the possibility of generating adaptive surface meshes suitable for the finite element method, directly from an approximated boundary representation of an object created with CAD software. First, we describe the boundary representation, which is composed of a simple triangulation of the surface of the object. Then we will show how to obtain a conforming size-adapted mesh. The size adaptation is made considering geometrical approximation and with respect to an isotropic size map provided by an error estimator. The mesh can be used “as is” for a finite element computation (with shell elements), or can be used as a surface mesh to initiate a volume meshing algorithm (Delaunay or advancing front). The principle used to generate the mesh is based on the Delaunay method, which is associated with refinement algorithms, and smoothing. Finally, we will show that not using the parametric representation of the geometrical model allows us to override some of the limitations of conventional meshing software that is based on an exact representation of the geometry.     

参数曲面的有限元网格化

基于推进波前法,本文提出了一种针对三维Trimmed参数曲面的有限元网格剖分方法,首先对曲面参数空间进行剖分,利用结点密度函数（与曲率有关）和生成内部结点的公式,使网格单元和结点能同时生成,然后把网格反映射到曲面上,从而实现参数曲面的三角形网格剖分。     

TUM.GeoFrame: automated high-order hexahedral mesh generation for shell-like structures

This paper presents a fully automated high-order hexahedral mesh generation algorithm for shell-like structures based on enhanced sweeping methods. Traditional sweeping techniques create all-hexahedral element meshes for solid structures by projecting an initial single surface mesh along a specified trajectory to a specified target surface. The work reported here enhances the traditional method for thin solids by creating conforming high-order all-hexahedral finite element meshes on an enhanced surface model with surfaces intersecting in parallel, perpendicular and skew-angled directions. The new algorithm is based on cheap projection rules separating the original surface model into a set of disjoint single surfaces and a so-called interface skeleton. The core of this process is reshaping the boundary representations of the initial surfaces, generating new sweeping templates along the intersection curves and joining the single swept hex meshes in an independently generated interface mesh.     

基于黎曼度量参数曲面四边形网格生成方法及UG 实现

论文给出了基于黎曼度量的参数曲面网格生成的改进铺砖算法。阐述了曲 面自身的黎曼度量,并且运用黎曼度量计算二维参数域上单元节点的位置,从而使映射到三 维物理空间的四边形网格形状良好。文中对原有铺砖法相交处理进行了改进,在运用铺砖法 的同时调用UG-NX 强大的二次开发库函数获取相应的信息,直接在UG-NX 模型的表面生 成四边形网格。算例表明,该法能在曲面上生成质量好的网格。     

扫掠法有限元网格生成方法

为了提高有限元网格的生成质量,扫掠法生成六面体网格过程中内部节点定位成为关键一步,在研究复杂扫掠体六面体有限元网格生成算法过程中,提出了一种基于扫掠法的六面体网格生成算法,算法利用源曲面已经划分好的网格和连接曲面的结构化网格,用仿射映射逐层投影,生成目标曲面,提出基于Roca算法的内部节点定位的新算法,运用由外向内推进的波前法思想,生成全部的六面体网格。通过实例表明,该算法快速,稳定,可靠,可处理大量复杂2.5维实体六面体网格生成问题。