Automatic hexahedral mesh generation for multi-domain composite models using a hybrid projective grid-based method

This paper presents an algorithm to generate an all-hexahedral mesh of a multi-domain solid model using a hybrid grid-based approach. This is based on a projective concept during the boundary adaptation of the initial mesh. In general, the algorithm involves the generation of a grid structure, which is superimposed on the solid model. This grid structure forms an initial mesh consisting of hexahedral elements, which intersect fully or partially with the solid model. This initial mesh is then shrunk in an outside-in manner to the faces of the model through a node projection process using the closest position approach. To match the resulting mesh to the edges of the model, a minimal deformation angle method is used. Finally, to match the vertices with the nodes on the mesh, a minimal warp angle method is employed. To create the mesh of a multi-domain solid model, an outside-in and inside-in hybrid of the grid-based method is used. This hybrid method ensures that the meshes of the different domains are conforming at their common boundary. This paper also describes two methods for resolving cases of degenerate elements: a splitting technique and a wedge insertion technique.     

A grid-based algorithm for the generation of hexahedral element meshes

An algorithm for the generation of hexahedralelement meshes is presented. The algorithm works in two steps: first the interior of the volume is filled with a regular grid; then the boundary region is meshed by using basically twodimensional operations.The algorithm was designed for use in the fem-simulation of metal forming processes where a remeshing must be done very often. In principle, it can be used for meshing any geometry with hexahedral elements and examples of meshes for geometries arising from various applications are given. The algorithm is checked against the criteria proposed by Sabin [1] (Advances in Engineering Software, 13, 220–225).     

Octree-based automatic mesh generation for non-manifold domains

Automatic mesh generation within the context of non-manifold geometric models is far from a commercial reality. While manifold objects are the most commonly encountered domains in many applications, other applications such as those requiring multiple material models and mixedmodel representations (combination of 1-D, 2-D and 3-D domains) fall beyond the realm of the existing automatic meshing procedures as they require a non-conventional modeling enviroment, namely the non-manifold topology (NMT) based environment. This paper focuses on automatic mesh generation issues in the context of two such applications: (i) finite element modeling for multiple material models and (ii) geometric abstractions requiring a mixed-model representation. Specifically, the paper describes a geometry utility system, built around an NMT data structure and geometry-based meshing algorithms that ensure the validity of the mesh for non-manifold domains.GE Consulting Services.     

A new automated scheme of quadrilateral mesh generation for randomly distributed line constraints

This paper presents a new automated method of quadrilateral meshes with random line constraints which have not been fully considered in previous models. The authors developed a new looping scheme and a direct quadrilateral forming algorithm based on advanced front techniques. This generator overcomes the limitations of previous studies such as line constraint, unmeshed hole and mesh refinement. A qualitative test reveals that our algorithm is reliable and suitable at the field needed for very accurate results. The developed direct method to handle line-typed features automatically makes the multiple discretizations without any user interaction and modification.     

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.     

Simultaneous untangling and smoothing of quadrilateral and hexahedral meshes using an object-oriented framework

In this work, we present a simultaneous untangling and smoothing technique for quadrilateral and hexahedral meshes. The algorithm iteratively improves a quadrilateral or hexahedral mesh by minimizing an objective function defined in terms of a regularized algebraic distortion measure of the elements. We propose several techniques to improve the robustness and the computational efficiency of the optimization algorithm. In addition, we have adopted an object-oriented paradigm to create a common framework to smooth meshes composed by any type of elements, and using different minimization techniques. Finally, we present several examples to show that the proposed technique obtains valid meshes composed by high-quality quadrilaterals and hexahedra, even when the initial meshes contain a large number of tangled elements.     

Intelligent finite element mesh generation

A knowledge-based and automatic finite element mesh generator (INTELMESH) for two-dimensional linear elasticity problems is presented. Unlike other approaches, the proposed technique incorporates the information about the object geometry as well as the boundary and loading conditions to generate an a priori finite element mesh which is more refined around the critical regions of the problem domain. INTELMESH uses a blackboard architecture expert system and the new concept of substracting to locate the critical regions in the domain and to assign priority and mesh size to them. This involves the decomposition of the original structure into substructures (or primitives) for which an initial and approximate analysis can be performed by using analytical solutions and heuristics. It then uses the concept of wave propagation to generate graded nodes in the whole domain with proper density distribution. INTELMESH is fully automatic and allows the user to define the problem domain with minimum amount of input such as object geometry and boundary and loading conditions. Once nodes have been generated for the entire domain, they are automatically connected to form well-shaped triangular elements ensuring the Delaunay property. Several examples are presented and discussed. When incorporated into and compared with the traditional approach to the adaptive finite element analysis, it is expected that the proposed approach, which starts the process with near optimal initial meshes, will be more accurate and efficient.     

New method for graded mesh generation of all hexahedral finite elements

Mapping method is widely applied by most of commercial mesh generators because of its efficiency, mesh quality. One of the obstacles to apply the mapping method and generate a graded all hexahedral mesh of high quality in an arbitrarily three-dimensional domain is the generation of hexahedral parent elements on a super-element that allows for gradations in three co-ordinate directions. This paper presents a pattern module’s method to generate the graded mesh of all hexahedral elements in a cube and thus improves the mapping method. The method requires few calculations.     

A finite volume method for Stokes problems on quadrilateral meshes

We present a finite volume method for Stokes problems using the isoparametric $Q_1$–$Q_0$ element pair on quadrilateral meshes. To offset the lack of the $inf$–$sup$ condition, a jump term of discrete pressure (stabilizing term) is added to the continuity approximation equation. Thus, we establish a stabilized finite volume scheme on quadrilateral meshes. Then, based on some superclose estimates, we derive the optimal error estimates in the $H^1$- and $L_2$-norms for velocity and in the $L_2$-norm for pressure, respectively. Numerical examples are provided to illustrate our theoretical analysis. We emphasize that our work is the first time to propose and analyze a finite volume method for Stoke problems using isoparametric elements on quadrilateral meshes.     

An algorithm for automatic 2D quadrilateral mesh generation with line constraints

Finite element method (FEM) is a fundamental numerical analysis technique widely used in engineering applications. Although state-of-the-art hardware has reduced the solving time, which accounts for a small portion of the overall FEM analysis time, the relative time needed to build mesh models has been increasing. In particular, mesh models that must model stiffeners, those features that are attached to the plate in a ship structure, are imposed with line constraints and other constraints such as holes. To automatically generate a 2D quadrilateral mesh with the line constraints, an extended algorithm to handle line constraints is proposed based on the constrained Delaunay triangulation and Q-Morph algorithm. The performance of the proposed algorithm is evaluated, and numerical results of our proposed algorithm are presented.     

As-rigid-as-possible mesh deformation and its application in hexahedral mesh generation

This paper presents an efficient and stable as-rigid-as-possible mesh deformation algorithm for planar shape deformation and hexahedral mesh generation. The deformation algorithm aims to preserve two local geometric properties: scale-invariant intrinsic variables and elastic deformation energy, which are together represented in a quadric energy function. To preserve these properties, the position of each vertex is further adjusted by iteratively minimizing this quadric energy function to meet the position constraint of the controlling points. Experimental results show that the deformation algorithm is efficient, and can obtain physically plausible results, which have the same topology structure with the original mesh. Such a mesh deformation method is useful to project the source surface mesh onto the target surfaces in hexahedral mesh generation based on sweep method, and application results show that the proposed method is feasible to mesh projection not only between similar surface contours but also dissimilar surface contours.     

A consistent octree hanging node elimination algorithm for hexahedral mesh generation

A new algorithm for hanging node elimination in octree structures is developed. The proposed algorithm utilizes hanging node elimination by refinement templates and a new mesh conditioning technique based on decoupling templates. Refinement templates insert transition elements to eliminate hanging nodes. Decoupling templates insert circular loops in the dual mesh without introducing or removing hanging nodes. Decoupling templates are introduced to avoid full refinement in the cases that do not match any of the available refinement templates. The proposed algorithm eliminates hanging nodes for concavely refined regions without excessive refinement. Another advantage of the proposed algorithm lies in eliminating narrow gaps of coarse meshes between refined regions. This step has a positive effect on the mesh quality as it avoids introducing non-regular templates with a limited penalty of uniform refinement. The presented algorithm produces good quality meshes and provides a consistent and complete method for producing conformally refined octree structures.     

Tetrahedral finite element mesh generation from NURBS solid models

In this paper, the development and the implementation of a tetrahedral meshing algorithm for generation of finite element meshes from NURBS solid models is presented. The meshing algorithm is based on a Delaunay technique, and makes use of some spatial data structures. The algorithm is capable of generating both uniform and varying size four-node and ten-node tetrahedral meshes. The algorithm has been implemented in a building block approach as part of a software library. It has been used as a practical tool in engineering design processes. Several representative test cases illustrate the effectiveness of the automatic solid mesh generator.     

Block Cartesian abstraction of a geometric model and its application in hexahedral mesh generation

In this work, a fuzzy logic approach is proposed to transform a geometric model of arbitrary shape to its block Cartesian abstraction. This abstraction is topologically similar to the original model and it contains geometric sub-entities which are all aligned in the Cartesian directions. This is achieved by calculating the modifications made to the face normal vectors as a result of the influences of the adjacent faces. A fuzzy logic inference engine is developed by combining heuristics to emulate the local changes in face normal vectors with respect to the changes in the global space. A three-dimensional field morphing algorithm is used to position the features of this block Cartesian abstraction so that a congruent geometric model can be reconstructed. Such a model is useful for the generation of structured quadrilateral boundary element meshes or structured hexahedral meshes based on grid-based meshing method, mesh mapping or sweeping. This approach is also able to overcome the traditional problem of having poorly shaped elements at the boundary using the grid-based method of mesh generation. As the topology of the block Cartesian abstraction is congruent to the original model, the mesh can be mapped back to the original model by employing an inverse operation of the transformation.     

An efficient generation method of embedded reinforcement in hexahedral elements for reinforced concrete simulations

In this paper, an automatic procedure for the generation of embedded steel reinforcement inside hexahedral finite elements is presented. The automatic mapping of the entire reinforcement network inside the concrete hexahedral finite elements is performed using the end-point coordinates of the rebar reinforcement macro-elements. By introducing a geometrical constraint, this procedure decreases significantly the computational effort for generating the input data of the embedded rebar elements in three-dimensional finite-element analysis, particularly when dealing with relatively large-scale reinforced concrete models. The computational robustness and efficiency of the proposed mesh generation method are demonstrated through numerical experiments.     

An adaptive mesh refinement of quadrilateral finite element meshes based upon an a posteriori error estimation of quantities of interest: modal response

Modal analysis is commonly performed in a vehicle development process to assess dynamic responses of structure designs. This paper presents an adaptive quadrilateral refinement process for modal analysis of elastic shells based upon a posteriori error estimation in natural frequencies. The process provides engineers with an estimation of their modal analysis quality and an effective adaptive refinement tool for quadrilateral meshes. The effectiveness of the process is demonstrated on the eigenvalue analyses of two numerical examples, a shock tower cap and a roof structure. It shows that the solution error in the frequency of interest is effectively reduced through the adaptive refinement process, and the resulting frequency of interest converges to the solution of a very fine model.     

The geometric element transformation method for mixed mesh smoothing

The geometric element transformation method (GETMe) is a geometry-based smoothing method for mixed and non-mixed meshes. It is based on a simple geometric transformation applicable to elements bounded by polygons with an arbitrary number of nodes. The transformation, if applied iteratively, leads to a regularization of the polygons. Global mesh smoothing is accomplished by averaging the new node positions obtained by local element transformations. Thereby, the choice of transformation parameters as well as averaging weights can be based on the element quality which leads to high quality results. In this paper, a concept of an enhanced transformation approach is presented and a proof for the regularizing effect of the transformation based on eigenpolygons is given. Numerical examples confirm that the GETMe approach leads to superior mesh quality if compared to other geometry-based methods. In terms of quality it can even compete with optimization-based techniques, despite being conceptually significantly simpler.     

一种新的六面体有限元网格算法

在有限元网格产生过程中，吸取弦须编织法中的STC概念，将六面体以节点剖分为基础的思想转变为以单元点为基础，建立了以单元生长为核心的剖分算法，以期解决节点拓扑结构在三维情况下的控制问题，对进一步实现稳定、全自动的六面体剖分具有很大的帮助。