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

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

A novel method for automated grid generation of ice shapes for local‐flow analysis

Modelling a complex geometry, such as ice roughness, plays a key role for the computational flow analysis over rough surfaces. This paper presents two enhancement ideas in modelling roughness geometry for local flow analysis over an aerodynamic surface. The first enhancement is use of the leading‐edge region of an airfoil as a perturbation to the parabola surface. The reasons for using a parabola as the base geometry are: it resembles the airfoil leading edge in the vicinity of its apex and it allows the use of a lower apparent Reynolds number. The second enhancement makes use of the Fourier analysis for modelling complex ice roughness on the leading edge of airfoils. This method of modelling provides an analytical expression, which describes the roughness geometry and the corresponding derivatives. The factors affecting the performance of the Fourier analysis were also investigated. It was shown that the number of sine–cosine terms and the number of control points are of importance. Finally, these enhancements are incorporated into an automated grid generation method over the airfoil ice accretion surface. The validations for both enhancements demonstrate that they can improve the current capability of grid generation and computational flow field analysis around airfoils with ice roughness. Copyright © 2004 John Wiley & Sons, Ltd.     

A method for generating irregular computational grids in multiply connected planar domains

A method for generating irregular triangular computational grids in two-dimensional multiply connected domains is described. A set of points around each body is defined using a simple grid generation technique appropriate to the geometry of each body. The Voronoi regions associated with the resulting global point distribution are constructed from which the Delaunay triangulation of the set of points is thus obtained. The definition of Voronoi regions ensures that the triangulation produces triangles of reasonable aspect ratios given a grid point distribution. The approach readily accommodates local clustering of grid points to facilitate variable resolution of the domain. The technique is generally applicable and has been used with success in computing triangular grids in multiply connected planar domains. The suitability of such grids for flow calculations is demonstrated using a finite element method for solution of the inviscid transonic flow over two- dimensional high-lift aerofoil configurations.     

复杂无粘流场数值模拟的矩形/三角形混合网格技术

建立了一套模拟复杂无粘流场的矩形／三角形混合网格技术，其中三角形仅限于物面附近，发挥非结构网格的几何灵活性，以少量的网格模拟复杂外型；同时在以外的区域采用矩形结构网格，发挥矩形网格计算简单快速的优势，有效地克服全非结构网格计算方法需要较大内存量和较长ＣＰＵ时间的不足．混合网格系统由修正的四分树方法生成．将ＮＮＤ有限差分与ＮＮＤ有限体积格式有机地融合于混合网格计算，消除了全矩形网格模拟曲边界的台阶效应，同时保证了网格间的通量守恒．数值实验表明本方法在模拟复杂无粘流场方面的灵活性和高效性．     

Automatic grid generation of complex geometries in Cartesian co-ordinates

A method of automatic grid generation for complex boundaries in Cartesian co-ordinates is proposed in this paper. In addition to the Cartesian grid lines the diagonal segments are used for the approximations of complex geometries in Cartesian co-ordinates. A structured Cartesian grid is employed for the sake of the numerical simplicity and the potential of automatic grid generation. The automatic grid generation is achieved by this diagonal Cartesian method and the accuracy estimations of geometry approximations are given. The approximations of a few complex geometries, such as the multibody system in porous media, lake banks, grooved channels and spheres are shown and analyzed. The proposed method is verified by the numerical solutions of a rotated cavity flow. It is shown that the diagonal Cartesian method improves both the accuracy of geometry approximations and the numerical solution of a rotated cavity flow, comparing with the traditional saw-tooth method in which only Cartesian grid lines are utilized for geometry approximations. The stability and convergence of the proposed method is demonstrated. Finally, the application of the diagonal Cartesian method for the prediction of a grooved channel flow is presented. © 1998 John Wiley & Sons, Ltd.     

An adaptive Cartesian grid generation method for ‘Dirty’ geometry

Traditional structured and unstructured grid generation methods need a ‘water‐tight’ boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if ‘non‐water‐tight’ geometries are given. Significant user time can be taken to repair or clean a ‘dirty’ geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently ‘connected’ to the boundary, and the boundary grid is a result of this ‘connection’. A significant advantage of the I2B approach is that ‘dirty’ geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle ‘dirty’ geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright © 2002 John Wiley & Sons, Ltd.     

The solution of two‐dimensional free‐surface problems using automatic mesh generation

A new method is described for the iterative solution of two‐dimensional free‐surface problems, with arbitrary initial geometries, in which the interior of the domain is represented by an unstructured, triangular Eulerian mesh and the free surface is represented directly by the piecewise‐quadratic edges of the isoparametric quadratic‐velocity, linear‐pressure Taylor–Hood elements. At each time step, the motion of the free surface is computed explicitly using the current velocity field and, once the new free‐surface location has been found, the interior nodes of the mesh are repositioned using a continuous deformation model that preserves the original connectivity. In the event that the interior of the domain must be completely remeshed, a standard Delaunay triangulation algorithm is used, which leaves the initial boundary discretisation unchanged. The algorithm is validated via the benchmark viscous flow problem of the coalescence of two infinite cylinders of equal radius, in which the motion is due entirely to the action of capillary forces on the free surface. This problem has been selected for a variety of reasons: the initial and final (steady state) geometries differ considerably; in the passage from the former to the latter, large free‐surface curvatures—requiring accurate modelling—are encountered; an analytical solution is known for the location of the free surface; there exists a large body of literature on alternative numerical simulations. A novel feature of the present work is its geometric generality and robustness; it does not require a priori knowledge of either the evolving domain geometry or the solution contained therein. Copyright © 1999 John Wiley & Sons, Ltd.     

A finite volume method for numerical grid generation

A novel method to generate body‐fitted grids based on the direct solution for three scalar functions is derived. The solution for scalar variables ξ, η and ζ is obtained with a conventional finite volume method based on a physical space formulation. The grid is adapted or re‐zoned to eliminate the residual error between the current solution and the desired solution, by means of an implicit grid‐correction procedure. The scalar variables are re‐mapped and the process is reiterated until convergence is obtained. Calculations are performed for a variety of problems by assuming combined Dirichlet–Neumann and pure Dirichlet boundary conditions involving the use of transcendental control functions, as well as functions designed to effect grid control automatically on the basis of boundary values. The use of dimensional analysis to build stable exponential functions and other control functions is demonstrated. Automatic procedures are implemented: one based on a finite difference approximation to the Cristoffel terms assuming local‐boundary orthogonality, and another designed to procure boundary orthogonality. The performance of the new scheme is shown to be comparable with that of conventional inverse methods when calculations are performed on benchmark problems through the application of point‐by‐point and whole‐field solution schemes. Advantages and disadvantages of the present method are critically appraised. Copyright © 1999 National Research Council of Canada.     

动态混合网格生成及隐式非定常计算方法

建立了一种基于动态混合网格的非定常数值计算方法. 混合网格由贴体的四边形网格、外场 的多层次矩形网格和中间的三角形网格构成. 当物体运动时，贴体四边形网格随物体运动而 运动，而外场的矩形网格保持静止，中间的三角形网格随之变形；当物体运动位移较大，导 致三角形网格的质量降低，甚至导致网格相交时，在局部重新生成网格. 新网格上的物理量 由旧网格上的物理量插值而得. 为了提高计算效率，采用了双时间步和子迭代相结合的隐式 有限体积格式计算非定常Navier-Stokes方程. 子迭代采用高效的块LU-SGS方法. 利用该 方法数值模拟了NACA0012振荡翼型的无黏和黏性绕流，得到了与实验和他人计算相当一致 的结果.     

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

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

Hybrid grid generation for viscous flow analysis

Cartesian grid with cut‐cell method has drawn attention of CFD researchers owing to its simplicity. However, it suffers from the accuracy near the boundary of objects especially when applied to viscous flow analysis. Hybrid grid consisting of Cartesian grid in the background, body‐fitted layer near the object, and transition layer connecting the two is an interesting alternative. In this paper, we propose a robust method to generate hybrid grid in two‐dimensional (2D) and three‐dimensional (3D) space for viscous flow analysis. In the first step, body‐fitted layer made of quadrangles (in 2D) or prisms (in 3D) is created near the object's boundary by extruding front nodes with a speed function depending on the minimum normal curvature obtained by quadric surface fitting. To solve global interferences effectively, a level set method is used to find candidates of colliding cells. Then, axis‐aligned Cartesian grid (quadtree in 2D or octree in 3D) is filled in the rest of the domain. Finally, the gap between body‐fitted layer and Cartesian grid is connected by transition layer composed of triangles (in 2D) or tetrahedrons (in 3D). Mesh in transition layer is initially generated by constrained Delaunay triangulation from sampled points based on size function and is further optimized to provide smooth connection. Our approach to automatic hybrid grid generation has been tested with many models including complex geometry and multi‐body cases, showing robust results in reasonable time. Copyright © 2012 John Wiley & Sons, Ltd.     

一种新的准结构网格生成方法

在有限元分析中,高质量的结构网格可以有效地提高有限元分析的精度,但结构网格的几何适应性差,针对复杂边界的二维计算模型,现有的方法很难自动生成高质量的结构网格;而非结构网格几何适应性很好,但存在计算效率低和精度差等问题。提出了一种新的准结构网格生成方法,能够实现复杂区域的网格自动生成并且具有高网格质量。该方法首先对计算区域运用Delaunay三角剖分技术生成粗背景网格;然后利用背景网格,使用优化的Voronoi图生成过渡的蜂巢网格;最后,通过中心圆方法对蜂巢网格单元进行结构网格剖分。分析NACA0012翼型数值模拟结果表明,提出的新准结构网格生成方法能够对边界复杂的模型自动生成高质量的网格,并且通过三种不同拓扑类型网格计算结果相互对比及与实验结果对比,证明准结构网格具有高计算精度。     

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

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

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

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

二维自适应网格生成的改进AFT与背景网格法

在基于重生成的自适应有限元网格生成算法研究中,将推进波前法（AFT）与背景网格法结合并提出改进方法,有效地解决了网格生成和单元尺寸计算这两个关键问题。改进的AFT方法,将前沿区分为活跃前沿和非活跃前沿两类,在选取目标前沿时既考虑前沿尺寸又考虑前沿分类。改进的背景网格法,利用结构化栅格对背景网格进行管理,在栅格中直接存放背景网格中的单元,既提高了新单元尺寸的计算速度,又从数值上保证了新生成网格中单元之间尺寸合理过渡。     

Three-dimensional vibration analysis of prisms with isosceles triangular cross-section

This paper studies the three-dimensional (3-D) free vibration of uniform prisms with isosceles triangular cross-section, based on the exact, linear and small strain elasticity theory. The actual triangular prismatic domain is first mapped onto a basic cubic domain. Then the Ritz method is applied to derive the eigenfrequency equation from the energy functional of the prism. A set of triplicate Chebyshev polynomial series, multiplied by a boundary function chosen to, a priori, satisfy the geometric boundary conditions of the prism is developed as the admissible functions of each displacement component. The convergence and comparison study demonstrates the high accuracy and numerical robustness of the present method. The effect of length-thickness ratio and apex angle on eigenfrequencies of the prisms is studied in detail and the results are compared with those obtained from the classical one-dimensional theory and the 3-D finite element method. Sets of valuable data known for the first time are reported, which can serve as benchmark values in applying various approximate beam and rod theories.     

Enhancing control of grid distribution in algebraic grid generation

Three techniques are presented to enhance the control of grid-point distribution for a class of algebraic grid generation methods known as the two-, four- and six-boundary methods. First, multidimensional stretching functions are presented, and a technique is devised to construct them based on the desired distribution of grid points along certain boundaries. Second, a normalization procedure is proposed which allows more effective control over orthogonality of grid lines at boundaries and curvature of grid lines near boundaries. And third, interpolating functions based on tension splines are introduced to control curvature of grid lines in the interior of the spatial domain. In addition to these three techniques, consistency conditions are derived which must be satisfied by all user-specified data employed in the grid generation process to control grid-point distribution. The usefulness of the techniques developed in this study was demonstrated by using them in conjunction with the two- and four-boundary methods to generate several grid systems, including a three-dimensional grid system in the coolant passage of a radial turbine blade with serpentine channels and pin fins.     

High-order curvilinear mesh generation technique based on an improved radius basic function approach

A high-order curvilinear hybrid mesh generation technique is developed for high-order numerical method (eg, discontinuous Galerkin method) applications to improve the accuracy for problems with curve boundary. The grid generation technique is based on an improved radius basic function (RBF) approach by which the straight-edge mesh is converted into high-order curve mesh. Firstly, an initial straight-edge mesh is prepared by traditional grid generation software. Then, high-order interpolation points are inserted into the mesh entities such as edges, faces, and cells according to the final demand of mesh order. To preserve the original geometry, the inserted points on solid wall are then projected onto the CAD model using an open source tool “Open Cascade.” Finally, other inserted points in the field near the solid wall are moved to appropriate positions by the improved RBF approach to avoid tangled cells. If we use the original RBF approach, then the inserted points on the edge and face entities normal to the solid boundary in the region of boundary layer will move to improper positions. To overcome this problem, a weighting based on the local grid aspect ratio between normal direction and tangential direction is introduced into the baseline RBF approach. Three typical configurations are tested to validate the mesh generator. Meanwhile, a third-order solution of subsonic flow over an analytical 3D body of revolution in the second International Workshop on High-Order CFD Methods is supplied by a discontinuous Galerkin solver. These numerical tests demonstrate the potential capability of present technique for high-order simulations of complex geometries.     

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

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

GEOMETRIC DRAWING METHOD FOR FORM-FINDING AND FORCE-FINDING FOR TRIANGULAR PRISM OF TENSEGRITY

力学和几何学是密不可分的,本文给出了一种几何作图法进行端面平行时张拉整体三棱柱的找形方法和作图确定自平衡内力大小的找力方法,并推导出找形后张拉整体三棱柱自平衡内力的力密度计算公式,通过算例验证了几何作图法找形与找力的正确性。几何作图法找形和找力方法操作简单,直观可控,可以在CAD软件中实现,甚至可以纸上手绘实现;自平衡力密度公式简单,表达直观,是力密度法的一种几何实现。