基于栅格法的多体六面体网格自动生成

基于栅格法的六面体网格生成算法由于多体模型复杂的边界几何特征,导致稳定性较差和产生一些质量较差的边界六面体单元.针对这一问题,提出一套以栅格法为基础的全六面体网格自动生成算法.在边界拟合环节,利用Embedding技术提出一种边界拟合算法,建立了实体模型边界元素和核心网格外围边界元素的对应关系,使得六面体网格很好地描述实体模型的几何特征;在拓扑优化环节,利用Pillowing技术给出一种消除网格中拓扑连接关系较差的六面体单元的方法.若干实体模型算例结果表明,该算法实用性强,效果良好.     

结合体细分的复杂六面体网格模型交互式构造方法

针对目前六面体网格模型生成与构造困难的问题,提出了一种基于体细分的复杂六面体网格模型交互式构造方法.用户首先通过交互方式构建出模型骨架,在骨架结构的节点处放置立方体,并对节点立方体进行旋转、平移、缩放等交互操作.然后,通过节点之间的连接与拓扑分裂操作,便可以生成初始的六面体控制网格.进一步,通过Catmull-Clark插值体细分方法生成具有不同分辨率的六面体网格.最后通过padding操作消除在边界处的退化单元以及提升六面体网格单元质量,从而得到最终的六面体网格模型.数值实例结果表明,所提方法可方便且高效地交互生成六面体网格,与传统方法相比,省略了从表面网格生成体网格的中间步骤,在有限元分析、等几何分析及动画建模中具有应用价值.     

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

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

一种适用于任意复杂结构的曲六面体网格生成算法

曲六面体网格自动生成是时域谱元法发展的瓶颈问题。本文采用基于体基函数的协变投影算法,将一个10节点曲四面体单元分解为四个20节点曲六面体单元,从而形成一种适用于任意复杂结构的曲六面体网格生成算法。使用该算法能够将曲四面体单元均匀分割,且确保新形成的曲六面体单元的翘曲最小。典型算例表明,使用该算法建立的曲六面体离散模型,完全满足时域谱元法的计算精度要求。     

基于投影法三维模型全六面体网格的划分方法

针对六面体网格自动划分的难度远高于四面体网格的问题,用投影法对简单形状的初始网格进行投影变换得到每个块体的实际网格,用节点合并算法和再分割技术实现不同块体之间的不同密度网格的过渡,从而生成复杂三维几何形体的全六面体网格.算例表明：该方法生成的网格质量很好,易于实施,适用性广.     

栅格法三维六面体网格局部加密算法

有限元数值分析的精度和效率与网格单元的划分质量以及疏密程度密切相关,针对三维六面体网格单元之间疏密过渡必须平缓和协调的要求,提出了一套基于8分法的六面体网格加密模板,并给出了相应的数据结构和模板应用方式.为使所有加密单元都有相对应的加密模板,建立了加密信息场调整规则;对需要进行加密的区域首先补充加密单元,按照节点加密属性调整加密信息场,然后根据单元加密属性对加密单元进行分类,按照全加密单元、面加密单元、边加密单元以及过渡加密单元的顺序依次采用相应的模板进行加密,从而实现三维六面体网格的局部协调加密.实例结果表明,采用该套加密模板的六面体网格局部加密算法能够保障密集网格向稀疏网格的平缓和协调过渡,所生成的网格可满足有限元数值计算的要求.     

基于结构化网格自动划分的汽车发动机强度分析

使用三维设计软件CATIA设计了汽车发动机的复杂结构,然后在网格划分软件HARPOON中将设计的发动机零件自动划分为以结构化六面体网格为主的有限元网格,最后在大型非线性有限元软件ABAQUS中,分析了发动机在静力和动力作用下的应力分布.计算结果表明,采用结构化六面体网格,单元数量少,计算速度快,结果可靠;而采用四面体网格,单元数量大,对于同样配置的计算机,无法进行四面体网格的模型的计算.网格尺寸增加后,单元数量减少,计算机可以计算四面体网格模型,但计算结果与六面体网格偏差比较大.     

基于片分割的六面体网格生成方法

为了发展一种保证边界质量、考虑全局信息、具有较高计算效率的六面体网格生成技术,提出了基于片分割的六面体网格生成方法.首先在标架场的指引下由实体表面的环扩展出一层六面体单元,然后用该六面体单元层将原实体分割为2个更小规模的子实体,最后采用同样的方式递归处理子实体直至子实体为空.该方法采用分而治之的策略,适宜于并行化.数值实验结果表明,文中方法生成的网格与当前领先的网格生成方法生成的网格质量相当.     

飞机蒙皮拉形模拟中上压模具网格的生成技术

为了解决飞机蒙皮拉形有限元仿真中上压模具(简称上模)与下模具(简称下模)型面网格间的协调问题,提出了以切割下模网格、调整不良网格、生成圆角和侧壁、单元与节点重新编号、网格厚向偏移等为主要步骤的上模网格生成过程.在切割下模网格时,根据被切型面网格的节点及其所在单元相对于切割平面的位置来判断该单元是否属于上模网格,并对单元与节点进行相应处理;对切割后的不良网格进行了形状与法向的调整,并在网格切割线位置按照给定宽度生成圆角单元,按给定的最大高度及高度方向上的单元数量生成侧壁单元;采用图论法对节点及单元重新编号,再按照零件厚度沿网格的法向进行网格偏移.对复杂的S形蒙皮、进气道蒙皮和翼身融合蒙皮的上模网格模型的生成进行验证的结果表明,采用文中提出的生成过程与方法能够顺利地生成与下模网格面相协调的上模网格.     

六面体网格生成和优化研究进展

文中总结了近十几年来六面体网格生成和优化的研究进展.首先概述六面体网格生成的研究进展,将其归为整体生成方法和基于模型分解的生成方法 2类,并指出各类方法的优缺点;然后概述六面体网格优化的研究现状,包括几何优化和拓扑优化;最后阐述六面体网格生成与优化的发展趋势.     

A strategy of automatic hexahedral mesh generation by using an improved whisker-weaving method with a surface mesh modification procedure

One of the demands for three dimensional (3D) finite element analyses is the development of an automatic hexahedral mesh generator. For this problem, several methods have been proposed by many researchers. However, reliable automatic hexahedral mesh generation has not been developed at present. In this paper, a new strategy of fully automatic hexahedral mesh generation is proposed. In this strategy, the prerequisite for generating a hexahedral mesh is a quadrilateral surface mesh. From the given surface mesh, combinatorial dual cycles (sheet loops for the whisker-weaving algorithm) are generated to produce a hexahedral mesh. Since generating a good quality hexahedral mesh does not depend only on the quality of quadrilaterals of the surface mesh but also on the quality of the sheet loops generated from it, a surface mesh modification method to remove self-intersections from sheet loops is developed. Next, an automatic hexahedral mesh generator by the improved whisker-weaving algorithm is developed in this paper. By creating elements and nodes on 3D real space during the weaving process, it becomes possible to generate a hexahedral mesh with fewer bad-quality elements. Several examples will be presented to show the validity of the proposed mesh generation strategy.     

三维实体仿真建模的网格自动生成方法

有限元网格模型的生成与几何拓扑特征和力学特性有直接关系。建立网格模型时，为了更真实地反映原几何形体的特征，在小特征尺寸或曲率较大等局部区域网格应加密剖分；为提高有限元分析精度和效率，在待分析的开口、裂纹、几何突变、外载、约束等具有应力集中力学特性的局部区域，网格应加密剖分。为此，该文提出了基于几何特征和物理特性相结合的网格自动生成方法。该方法既能有效地描述几何形体，又能实现应力集中区域的网格局部加密及粗细网格的均匀过渡。实例表明本方法实用性强、效果良好。     

Facial hexahedral mesh transferring by volumetric mapping based on harmonic fields

Hexahedral mesh has obvious mechanical advantages over tetrahedral mesh, but it is no trivial task to generate hexahedral mesh for complex object shapes such as individual faces. This paper presents a novel method to generate patient-specific hexahedral meshes of facial soft tissue models, based on a volumetric cross-parameterization mapping from a standard hexahedral mesh to the individual model. The volumetric parameterization is constructed based on triple of the volumetric harmonic fields, which are adapted to be as close to mutually orthogonal as possible, to achieve some quasi-conformal effect. In addition, some piecewise constraints on the harmonic fields are added to ensure anatomical feature correspondence. Experimental results show that our approach works efficiently for facial soft tissue modeling, avoids element flipping and preserves mesh element angles to a significant extent.     

Adaptive generation of hexahedral element mesh using an improved grid-based method

An improved grid-based algorithm for the adaptive generation of hexahedral finite element mesh is presented in this paper. It is named as the inside-out grid-based method and involves the following four steps. The first step is the generation of an initial grid structure which envelopes the analyzed solid model completely. And the elements size and density maps are constructed based on the surface curvature and local thickness of the solid model. Secondly, the core mesh is generated through removing all the undesired elements using even and odd parity rules. The third step is to magnify the core mesh in an inside-out manner through a surface node projection process using the closest position approach. To match the mesh to the characteristic boundary of the solid model, a minimal Scaled Jacobian criterion is employed. Finally, in order to handle the degenerated elements and improve the quality of the resulting mesh, two comprehensive techniques are employed: the insertion technique and collapsing technique. The present method was applied in the mesh construction of different engineering problems. Scaled Jacobian and Skew metrics are used to evaluate the hexahedral element mesh quality. The application results show that all-hexahedral element meshes which are well-shaped and capture all the geometric features of the original solid models can be generated using the inside-out grid-based method presented in this paper.     

An algorithm for automatic 2D finite element mesh generation with line constraints

In this study, an algorithm is designed specifically for automatic finite element (FE) mesh generation on the transverse structure of hulls reinforced by stiffeners. Stiffeners attached to the transverse structure are considered as line constraints in the geometry boundary. For the FE mesh generation used in this study, the line constraints are treated as boundaries and by that means the geometry domain attached to the line constraints is decomposed into sub-domains, constrained only by the closed boundaries. Then, the mesh can be generated directly on those sub-domains by the traditional approach. The performance of the proposed algorithm is evaluated and the quality of the generated mesh meets expectations.     

Meshing complexity: predicting meshing difficulty for single part CAD models

This paper proposes a method for predicting the complexity of meshing computer aided design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity refers to the relative level of effort required to generate a valid finite element mesh on a given CAD geometry. A function is proposed to approximate the meshing complexity for single part CAD models. The function is dependent on a user defined element size as well as on data extracted from the geometry and topology of the CAD part. Several geometry and topology measures are proposed, which both characterize the shape of the CAD part and detect configurations that complicate mesh generation. Based on a test suite of CAD models, the function is demonstrated to be accurate within a certain range of error. The solution proposed here is intended to provide managers and users of meshing software a method of predicting the difficulty in meshing a CAD model. This will enable them to make decisions about model simplification and analysis approaches prior to mesh generation.     

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

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

Skeleton‐driven Adaptive Hexahedral Meshing of Tubular Shapes

We propose a novel method for the automatic generation of structured hexahedral meshes of articulated 3D shapes. We recast the complex problem of generating the connectivity of a hexahedral mesh of a general shape into the simpler problem of generating the connectivity of a tubular structure derived from its curve‐skeleton. We also provide volumetric subdivision schemes to nicely adapt the topology of the mesh to the local thickness of tubes, while regularizing per‐element size. Our method is fast, one‐click, easy to reproduce, and it generates structured meshes that better align to the branching structure of the input shape if compared to previous methods for hexa mesh generation.