基于节点的局部网格生成算法

讨论了基于节点的有限元方法的网格生成算法及其产生的不一致性问题,提出了基于D e launay三角剖分的唯一性来克服网格不一致性现象的思想,并建议使用局部区域分割方法合理地确定探索圆半径,使中心节点的探索圆包含它的所有卫星点,进而确保算法无不一致性。理论分析和算例表明了该方法的可靠性及有效性。     

前沿推进曲面四边形网格生成算法

将一类前沿推进三角形曲面网格生成算法拓展到曲面四边形网格生成。新算法逐个单元推进前沿,避免了铺路法（Paving）逐排推进方式的鲁棒性问题,针对四边形算法在理想点计算、候选点列表构建和新单元生成等环节存在的特殊技术问题给出了系统的解决方案。数值实验表明,本文算法能针对复杂的组合参数曲面自动生成全四边形网格,网格质量优于...     

改进的栅格法有限元网格剖分

提出一种改进的栅格法网格剖分算法,该算法综合了栅榕法和Delaunay算法的优点,生成了四边形和三角形混合单元,保证了整体性能与局部性态最优,满足汽车覆盖件冲压成形模拟软件对有限元网格质量的需求.实践证明,本文提出的改进的栅格法网格剖分算法可行有效,生成网格的质量高,程序容易实现.该算法已经成功集成到商业化冲压成形模拟软件KMAS中.     

2D nearly orthogonal mesh generation

The Ryskin and Leal (RL) system is the most widely used mesh generation system for the orthogonal mapping. However, when this system is used in domains with complex geometry, particularly in those with sharp corners and strong curvatures, serious distortion or overlapping of mesh lines may occur and an acceptable solution may not be possible. In the present study, two methods are proposed to generate nearly orthogonal meshes with the smoothness control. In the first method, the original RL system is modified by introducing smoothness control functions, which are formulated through the blending of the conformal mapping and the orthogonal mapping; while in the second method, the RL system is modified by introducing the contribution factors. A hybrid system of both methods is also developed. The proposed methods are illustrated by several test examples. Applications of these methods in a natural river channel are demonstrated. It is shown that the modified RL systems are capable of producing meshes with an adequate balance between the orthogonality and the smoothness for complex computational domains without mesh distortions and overlapping. Copyright © 2004 John Wiley & Sons, Ltd.     

Structured mesh generation with smoothness controls

In geometrically complex domains, the Ryskin and Leal (RL) orthogonal mesh generation system may cause mesh distortion and overlapping problems when using the ‘weak constraint’ method with specified boundary point distribution for all boundaries. To resolve these problems, an improved RL system with automatic smoothness control is proposed. In this improved RL system, the automatic smoothness control mechanism is based on five types of smoothness conditions and includes the self‐adjustment mechanism and the auto‐evaluation mechanism for an empirical parameter. The proposed system is illustrated using several test examples. Several applications to natural domains are also demonstrated. It is shown that the improved RL system is capable of resolving the above problems at little cost of orthogonality. Copyright © 2006 John Wiley & Sons, Ltd.     

Optimal multi-block mesh generation for CFD

An assessment of various automatic block topology generation techniques for creating structured meshes has been performed in the first part of the paper. The objective is to find out optimal blocking methods for generating meshes suitable for flow simulations. The comparison has been carried out using an adjoint-based error analysis of the meshes generated by these block topologies. Different objective functions and numerical schemes have been used for this assessment. It is found that, in general, the medial axis-based approaches provide optimal blocking and yields better accuracy in computing the functional of interest. This is because the medial axis-based methods produce meshes which have better flow alignment specially in case of internal flows. In the second part of the paper, the adjoint-based error indicator has been used to adapt the block topology in the regions of large error.     

Two‐dimensional adaptive mesh generation

In this paper, a two‐dimensional adaptive elliptic mesh generation system, derived from the Ryskin and Leal (RL) orthogonal mesh generation system based on the orthogonal condition (orthogonality) and the cell area equal‐distribution principle (adaptivity), is presented. The proposed generation system takes into account not only the mesh orthogonality and adaptivity but also the mesh smoothness by adopting a method that the distortion functions is determined by both the scale factors and the averaged scale factors of the constant mesh lines. Examples and application show that the proposed generation system is effective and easy to use. Copyright © 2007 John Wiley & Sons, Ltd.     

平面区域四边形网格自动生成技术

本文分析和综述了四边形网格自动生成的各种算法,给出了三角形网格向四边形网格转换的局部算法,以及有FCT思想直接生成四边形和三角形网格算法。详细分析了此法之下生成网格的几何拓朴性质,最后给出实例验证了算法的有效性。     

任意多面体边界一致四面体网格生成方法

提出一种能够满足多面体边界几何与拓扑约束的边界一致恢复算法,解决了任意多面体的边界一致四面体网格生成问题。在恢复多面体的几何约束时,边界上可能会引入Steiner点,这样就不满足拓扑约束。对此,本文采用动态规划方法将Steiner点从边界上消除,修复与其相关四面体单元的拓扑关系,以保持原多面体边界的拓扑完整性,并采用扩展的Laplacian光顺算法优化劣质单元。在理论上,本文算法能够保证完整地恢复任意多面体的边界。算例表明,本文提出的边界一致恢复算法鲁棒性高,可应用于复杂多面体模型。     

Hybrid mesh generation using advancing reduction technique

This paper presents an application of the advancing reduction technique for 2D hybrid mesh generation (triangles + quadrilaterals). Based on an initial rectangle mesh (RM) covering the whole domain, the advancing reduction technique coarsens the base RM in a marching way from the boundary to the interior of the domain so that different zones of sub‐RMs with different edge lengths are recognized. These sub‐RMs are connected to each other with the so‐called transition layers which consist of the transition triangles and quadrilaterals. As demonstrated by examples, the proposed method is simple, efficient, and easy to implement. Copyright © 2015 John Wiley & Sons, Ltd.     

多特征几何体的全六面体网格自动生成方法

有限元分析的精度和效率与网格划分的质量有直接关系.目前尚缺乏一种普适性的自动网格划分方法,尤其是对于具有多种几何特征的复杂模型,现有的六面体网格自动划分算法存在不同几何特征间的网格兼容性较差以及孔状特征周围网格质量不高的问题.对此本文提出一种基于映射法的六面体网格自动生成方法,在映射法的基本框架下,将物理空间中的复杂几何体映射为计算空间中的规则几何体,引入边界顶点分类,将复杂几何体边界进行简化,将子域约束进行连接,寻找贯穿边界,以使映射网格在约束特征间兼容;对圆弧特征进行等效转化,降低曲率过大对于网格过渡的影响.实例验证表明,本方法稳定可靠,生成的六面体网格质量较高,能够解决多特征复杂几何体六面体网格自动划分问题.     

Automatic unstructured surface mesh generation for complex configurations

In this paper a new object‐oriented (OO) approach is presented for automatic parallel advancing front based surface mesh generation and adaptive remeshing for complex configurations. Based on the ST++‐system the advantages of the OO design and implementation compared to the traditional structural approach are described. Algorithmic enhancements to the advancing front method are explained, enabling a robust NURBS based triangulation process directly on B‐rep CAD data. The message passing (MPI) parallelization strategy together with the achievable performance improvements are demonstrated. With the outlined parallel geometry analysis/rasterization a powerful method is described to derive automatically a well suited mesh size specification without any user‐interaction from scratch. The application of this method to a complex ‘real world’ example finishes this paper. Copyright © 2004 John Wiley & Sons, Ltd.     

AUTOMATIC MESH GENERATION OF 3—D GEOMETRIC MODELS

In this paper the presentation of the ball-packing method is reviewed, and a scheme to generate mesh for complex 3-D geometric models is given, which consists of 4 steps: (1) create nodes in 3-D models by ball-packing method, (2) connect nodes to generate mesh by 3-D Delaunay triangulation, (3) retrieve the boundary of the model after Delaunay triangulation, (4) improve the mesh.     

有限元网格自组织神经网络的自动生成

利用多个自组织神经网络的同时训练,可以一次性自动地生成计算区域内与计算区域边界上所有网格节点,尔后按FGT法的基本思想将节点连接成所需的三角形或四边形单元。由于在自组织神经网络中采用了改善的目标函数,节点的分布可以实现自适应调节以反映网格疏密分布的要求。文末几个算例验收证明本算法具有自适应性,适用于凸域、凹域、多连通域等多种情况。     

Automated quadrilateral mesh generation for digital image structures

With the development of advanced imaging technology, digital images are widely used. This paper proposes an automatic quadrilateral mesh generation algorithm for multi-colour imaged structures. It takes an original arbitrary digital image as an input for automatic quadrilateral mesh generation, this includes removing the noise, extracting and smoothing the boundary geometries between different colours, and automatic all-quad mesh generation with the above boundaries as constraints. An application example is provided to demonstrate the usefulness and effectiveness of the proposed approach.     

一种基于双前沿推进的边界层网格生成算法

高雷诺数粘性流动模拟对边界层内的网格正交性有特殊要求.对于复杂外形,这类问题的网格自动化生成十分困难.面向该问题,提出一种双前沿推进思想,并形成一种面向复杂几何外形的边界层网格全自动生成算法.结合多种网格技术处理局部几何特征以保证边界层网格的质量.双前沿推进思想同时适用于多块结构网格和混合网格的边界层网格生成.多个模型...     

Impact of tetrahedralization on parallel conforming octree mesh generation

This work discusses the performance impact from the tetrahedralization of non‐conforming meshes generated by a parallel octree method capable of handling arbitrary immersed geometries. First, we review conforming techniques for meshes created from octrees. Then we implement a tetrahedralization scheme based on templates in a parallel meshing algorithm that uses a linear octree with 2:1 balancing constraint. Besides, we also propose a change on the partitioning strategy for the same meshing algorithm to improve the octree refinement load balancing. Scalability analyses show that the chosen tetrahedralization technique preserves algorithm performance. Copyright © 2014 John Wiley & Sons, Ltd.     

并行有限元网格生成方法及其应用

大型工程数值仿真中,在前处理阶段需要生成千万甚至亿量级的网格,传统的串行网格生成方法由于内存和时间的限制,难以处理如此规模的网格。针对此问题,本文提出了一种大规模网格并行生成方法。首先基于推进波前法对几何模型进行初始体网格划分,接着利用图论理论进行区域分解,并通过表面单元恢复保持其几何精度,然后通过分裂法进行网格的并行生成。将所述方法应用到实际大型工程数值仿真前处理阶段,结果表明所述方法可以获得较好的并行效率,同时所产生的网格质量可以满足后续计算需要。     

一种三维表面网格自动生成方法

提出了一种改进的区域分解法,用于三维表面三角形和四边形网格的自动生成。基于区域分解法的三维表面网格生成的主要技术包括三维表面三角形面片拓扑关系的建立,表面三角形面片的分组及特征面的确定,空间曲线上网格节点的生成,区域内外边界的合并,最佳剖分面的确定,以及网格的光滑处理等。本文对这些技术进行了详细的介绍。本文提出的表面网格生成方法具有算法可靠、生成网格效率高以及生成网格质量高等优点。最后给出三维表面网格生成实例验证了本文提出方法的可靠性。     

基于四叉树法的有限元网格自动生成及凝聚方法

本文介绍了用于有限元网格自动划分的四叉树方法及相应的非均匀网格的生成方法──网格凝聚法。此方法可以用于处理任意形状的单连通或多连通的平面结构，其边界以折线及二次曲线描述。相应的网格生成器用户界面友好，极少需要人工干预。所生成的单元大多为四边形元，在边界处理时用了少量三角元，所有单元性态良好。非均匀网格可以实现多处、多重加密。