Automatic metric 3D surface mesh generation using subdivision surface geometrical model. Part 2: Mesh generation algorithm and examples

In this paper, a new metric advancing front surface mesh generation scheme is suggested. This new surface mesh generator is based on a new geometrical model employing the interpolating subdivision surface concept. The target surfaces to be meshed are represented implicitly by interpolating subdivision surfaces which allow the presence of various sharp and discontinuous features in the underlying geometrical model. While the main generation steps of the new generator are based on a robust metric surface triangulation kernel developed previously, a number of specially designed algorithms are developed in order to combine the existing metric advancing front algorithm with the new geometrical model. As a result, the application areas of the new mesh generator are largely extended and can be used to handle problems involving extensive changes in domain geometry. Numerical experience indicates that, by using the proposed mesh generation scheme, high quality surface meshes with rapid varying element size and anisotropic characteristics can be generated in a short time by using a low‐end PC. Finally, by using the pseudo‐curvature element‐size controlling metric to impose the curvature element‐size requirement in an implicit manner, the new mesh generation procedure can also generate finite element meshes with high fidelity to approximate the target surfaces accurately. Copyright © 2003 John Wiley & Sons, Ltd.     

Measuring the conformity of non‐simplicial elements to an anisotropic metric field

This paper extends an approach for measuring the element conformity of simplices to non‐simplicial elements of any type, in spaces of arbitrary dimension. Element non‐conformity is defined as the difference between a given size specification map, in the form of a Riemannian metric tensor, and the actual metric tensor of the element. An approach to the measurement of non‐conformity coefficients of non‐simplicial elements based on sub‐simplex division is proposed. An analysis of the measure's behaviour presented for quadrilaterals, hexahedra, prisms and pyramids shows that the measure is sensitive to size, stretching and orientation variations, as well as to other types of element shape degeneration. Finally, numerical applications show that the metric conformity measure can be used as a quality measure to quantify the discrepancy between a whole non‐simplicial mesh and a complex anisotropic size specification map. Copyright © 2005 John Wiley & Sons, Ltd.     

Automatic adaptive FE analysis of thin‐walled structures using 3D solid elements

In this study, a new automatic adaptive refinement procedure for thin‐walled structures using 3D solid elements is suggested. This procedure employs a specially designed superconvergent patch recovery (SPR) procedure for stress recovery, the Zienkiewicz and Zhu (Z–Z) error estimator for the a posteriori error estimation, a new refinement strategy for new element size prediction and a special mesh generator for adaptive mesh generation. The proposed procedure is different from other schemes in such a way that the problem domain is separated into two distinct parts: the shell part and the junction part. For stress recovery and error estimation in the shell part, special nodal coordinate systems are used and the stress field is separated into two components. For the refinement strategy, different procedures are employed for the estimation of new element sizes in the shell and the junction parts. Numerical examples are given to validate the effectiveness of the suggested procedure. It is found that by using the suggested refinement procedure, when comparing with uniform refinement, higher convergence rates were achieved and more accurate final solutions were obtained by using fewer degrees of freedoms and less amount of computational time. Copyright © 2008 John Wiley & Sons, Ltd.     

An adaptive remeshing procedure for discontinuous finite element limit analysis

An adaptive remeshing procedure is proposed for discontinuous finite element limit analysis. The procedure proceeds by iteratively adjusting the element sizes in the mesh to distribute local errors uniformly over the domain. To facilitate the redefinition of element sizes in the new mesh, the interelements discontinuous field of elemental bound gaps is converted into a continuous field, ie, the intensity of bound gap, using a patch‐based approximation technique. An analogous technique is subsequently used for the approximation of element sizes in the old mesh. With these information, an optimized distribution of element sizes in the new mesh is defined and then scaled to match the total number of elements specified for each iteration in the adaptive remeshing process. Finally, a new mesh is generated using the advancing front technique. This adaptive remeshing procedure is repeated several times until an optimal mesh is found. Additionally, for problems involving discontinuous boundary loads, a novel algorithm for the generation of fan‐type meshes around singular points is proposed explicitly and incorporated into the main adaptive remeshing procedure. To demonstrate the feasibility of our proposed method, some classical examples extracted from the existing literary works are studied in detail.     

An extended advancing front technique for closed surfaces mesh generation

An extended advancing front technique (AFT) with shift operations and Riemann metric named as shifting‐AFT is presented for finite element mesh generation on 3D surfaces, especially 3D closed surfaces. Riemann metric is used to govern the size and shape of the triangles in the parametric space. The shift operators are employed to insert a floating space between real space and parametric space during the 2D parametric space mesh generation. In the previous work of closed surface mesh generation, the virtual boundaries are adopted when mapping the closed surfaces into 2D open parametric domains. However, it may cause the mesh quality‐worsening problem. In order to overcome this problem, the AFT kernel is combined with the shift operator in this paper. The shifting‐AFT can generate high‐quality meshes and guarantee convergence in both open and closed surfaces. For the shifting‐AFT, it is not necessary to introduce virtual boundaries while meshing a closed surface; hence, the boundary discretization procedure is largely simplified, and moreover, better‐shaped triangles will be generated because there are no additional interior constraints yielded by virtual boundaries. Comparing with direct methods, the shifting‐AFT avoids costly and unstable 3D geometrical computations in the real space. Some examples presented in this paper have demonstrated the advantages of shift‐AFT in 3D surface mesh generation, especially for the closed surfaces. Copyright © 2007 John Wiley & Sons, Ltd.     

A new finite point generation scheme using metric specifications

A new approach to generate finite point meshes on 2D flat surface and any bi‐variate parametric surfaces is suggested. It can be used to generate boundary‐conforming anisotropic point meshes with node spacing compatible with the metric specifications defined in a background point mesh. In contrast to many automatic mesh generation schemes, the advancing front concept is abandoned in the present method. A few simple basic operations including boundary offsetting, node insertion and node deletion are used instead. The point mesh generation schemeis initialized by a boundary offsetting procedure. The point mesh quality is then improved by node insertion and deletion such that optimally spaced nodes will fill up the entire problem domain. In addition to the point mesh generation scheme, a new way to define the connectivity of a point mesh is also suggested. Furthermore, based on the connectivity information, a new scheme to perform smoothing for a point mesh is proposed toimprove the node spacing quality of the mesh. Timing shows thatdue to the simple node insertion and deletion operations, the generation speed of the new scheme is nearly 10 times faster than a similar advancing front mesh generator. Copyright © 2000 John Wiley & Sons, Ltd.     

Anisotropic tetrahedral meshing via bubble packing and advancing front

This paper presents a new computational method for anisotropic tetrahedral meshing. The method can control element anisotropy based on a specified 3×3 tensor field defined over a volumetric domain. Our method creates a tetrahedral mesh in two steps: (1) placing nodes at the centres of tightly packed ellipsoidal cells, called bubbles, in the domain, and (2) connecting the nodes by a modified advancing front followed by local transformation. The method creates a high‐quality anisotropic mesh that conforms well to a specified tensor field. Copyright © 2003 John Wiley & Sons, Ltd.     

Anisotropic adaptive simulation of transient flows using discontinuous Galerkin methods

An anisotropic adaptive analysis procedure based on a discontinuous Galerkin finite element discretization and local mesh modification of simplex elements is presented. The procedure is applied to transient two‐ and three‐dimensional problems governed by Euler's equation. A smoothness indicator is used to isolate jump features where an aligned mesh metric field in specified. The mesh metric field in smooth portions of the domain is controlled by a Hessian matrix constructed using a variational procedure to calculate the second derivatives. The transient examples included demonstrate the ability of the mesh modification procedures to effectively track evolving interacting features of general shape as they move through a domain. Copyright © 2004 John Wiley & Sons, Ltd.     

An L∞–Lp mesh‐adaptive method for computing unsteady bi‐fluid flows

This paper discusses the contribution of mesh adaptation to high‐order convergence of unsteady multi‐fluid flow simulations on complex geometries. The mesh adaptation relies on a metric‐based method controlling the L ^p‐norm of the interpolation error and on a mesh generation algorithm based on an anisotropic Delaunay kernel. The mesh‐adaptive time advancing is achieved, thanks to a transient fixed‐point algorithm to predict the solution evolution coupled with a metric intersection in the time procedure. In the time direction, we enforce the equidistribution of the error, i.e. the error minimization in L ^∞ norm. This adaptive approach is applied to an incompressible Navier–Stokes model combined with a level set formulation discretized on triangular and tetrahedral meshes. Applications to interface flows under gravity are performed to evaluate the performance of this method for this class of discontinuous flows. Copyright © 2010 John Wiley & Sons, Ltd.     

Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part I—a framework for surface mesh optimization

Structured mesh quality optimization methods are extended to optimization of unstructured triangular, quadrilateral, and mixed finite element meshes. New interpretations of well‐known nodally based objective functions are made possible using matrices and matrix norms. The matrix perspective also suggests several new objective functions. Particularly significant is the interpretation of the Oddy metric and the smoothness objective functions in terms of the condition number of the metric tensor and Jacobian matrix, respectively. Objective functions are grouped according to dimensionality to form weighted combinations. A simple unconstrained local optimum is computed using a modified Newton iteration. The optimization approach was implemented in the CUBIT mesh generation code and tested on several problems. Results were compared against several standard element‐based quality measures to demonstrate that good mesh quality can be achieved with nodally based objective functions. Published in 2000 by John Wiley & Sons, Ltd.     

Automatic generation of multiblock decompositions of surfaces

Multiblock‐structured meshes have significant advantages over fully unstructured meshes in numerical simulation, but automatically generating these meshes is considerably more difficult. A method is described herein for automatically generating high‐quality multiblock decompositions of surfaces with boundaries. Controllability and flexibility are useful capabilities of the method. Additional alignment constraints for forcing the appearance of particular features in the decomposition can be easily handled. Also, adjustments are made according to input metric tensor fields that describe target element size properties. The general solution strategy is based around using a four‐way symmetry vector‐field, called a cross‐field, to describe the local mesh orientation on a triangulation of the surface. Initialisation is performed by propagating the boundary alignment constraints to the interior in a fast marching method. This is similar in a way to an advancing‐front or paving method but much more straightforward and flexible because mesh connectivity does not have to be managed in the cross‐field. Multiblock decompositions are generated by tracing the separatrices of the cross‐field to partition the surface into quadrilateral blocks with square corners. The final task of meshing the decomposition requires solving an integer programming problem for block division numbers. Copyright © 2015 John Wiley & Sons, Ltd.     

Automatic sizing functions for unstructured surface mesh generation

Accurate sizing functions are crucial for efficient generation of high‐quality meshes, but to define the sizing function is often the bottleneck in complicated mesh generation tasks because of the tedious user interaction involved. We present a novel algorithm to automatically create high‐quality sizing functions for surface mesh generation. First, the tessellation of a Computer Aided Design (CAD) model is taken as the background mesh, in which an initial sizing function is defined by considering geometrical factors and user‐specified parameters. Then, a convex nonlinear programming problem is formulated and solved efficiently to obtain a smoothed sizing function that corresponds to a mesh satisfying necessary gradient constraint conditions and containing a significantly reduced element number. Finally, this sizing function is applied in an advancing front mesher. With the aid of a walk‐through algorithm, an efficient sizing‐value query scheme is developed. Meshing experiments of some very complicated geometry models are presented to demonstrate that the proposed sizing‐function approach enables accurate and fully automatic surface mesh generation. Copyright © 2016 John Wiley & Sons, Ltd.     

Adaptive tetrahedral mesh generation by constrained Delaunay refinement

This paper presents a tetrahedral mesh generation method for numerically solving partial differential equations using finite element or finite volume methods in three‐dimensional space. The main issues are the mesh quality and mesh size, which directly affect the accuracy of the numerical solution and the computational cost. Two basic problems need to be resolved, namely boundary conformity and field points distribution. The proposed method utilizes a special three‐dimensional triangulation, so‐called constrained Delaunay tetrahedralization to conform the domain boundary and create field points simultaneously. Good quality tetrahedra and graded mesh size can be theoretically guaranteed for a large class of mesh domains. In addition, an isotropic size field associated with the numerical solution can be supplied; the field points will then be distributed according to it. Good mesh size conformity can be achieved for smooth sizing informations. The proposed method has been implemented. Various examples are provided to illustrate its theoretical aspects as well as practical performance. Copyright © 2008 John Wiley & Sons, Ltd.     

A universal measure of the conformity of a mesh with respect to an anisotropic metric field

In this paper, a method is presented to measure the non‐conformity of a mesh with respect to a size specification map given in the form of a Riemannian metric. The measure evaluates the difference between the metric tensor of a simplex of the mesh and the metric tensor specified on the size specification map. This measure is universal because it is a unique, dimensionless number which characterizes either a single simplex of a mesh or a whole mesh, both in size and in shape, be it isotropic or anisotropic, coarse or fine, in a small or a big domain, in two or three dimensions. This measure is important because it can compare any two meshes in order to determine unequivocally which of them is better. Analytical and numerical examples illustrate the behaviour of this measure. Copyright © 2004 John Wiley & Sons, Ltd.     

Feature based quadrilateral mesh generation for sculptured surface products

A successful approach to the generation of quadrilateral surface meshes for finite element analysis of sculptured surface products is presented. The free-form sculpted surface is divided into a feature based product anatomy which is used as the basis for defining regions of simpler shape that are related by the requirement for mesh continuity across their boundaries. Each surface region is meshed using a paving algorithm. Large surface areas are further subdivided to introduce new boundaries which improve contiol over mesh transitions and element distortion. A procedure, based on this approach, which generates well formed meshes on sculptured surface products is described using a hollow golf club head as an example. The approach is product specific and relies on initial user interaction to populate a feature based product data model. Thus, the data model contains, the attributes of a finite element mesh tailored to the product, which can be used to generate meshes on subsequent design iterations or other members of the product family with a high degree of automation, leading to reduced analysis cost.     

A new automatic adaptive 3D solid mesh generation scheme for thin‐walled structures

A new algorithm to generate three‐dimensional (3D) mesh for thin‐walled structures is proposed. In the proposed algorithm, the mesh generation procedure is divided into two distinct phases. In the first phase, a surface mesh generator is employed to generate a surface mesh for the mid‐surface of the thin‐walled structure. The surface mesh generator used will control the element size properties of the final mesh along the surface direction. In the second phase, specially designed algorithms are used to convert the surface mesh to a 3D solid mesh by extrusion in the surface normal direction of the surface. The extrusion procedure will control the refinement levels of the final mesh along the surface normal direction. If the input surface mesh is a pure quadrilateral mesh and refinement level in the surface normal direction is uniform along the whole surface, all hex‐meshes will be produced. Otherwise, the final 3D meshes generated will eventually consist of four types of solid elements, namely, tetrahedron, prism, pyramid and hexahedron. The presented algorithm is highly flexible in the sense that, in the first phase, any existing surface mesh generator can be employed while in the second phase, the extrusion procedure can accept either a triangular or a quadrilateral or even a mixed mesh as input and there is virtually no constraint on the grading of the input mesh. In addition, the extrusion procedure development is able to handle structural joints formed by the intersections of different surfaces. Numerical experiments indicate that the present algorithm is applicable to most practical situations and well‐shaped elements are generated. Copyright © 2004 John Wiley & Sons, Ltd.     

Computational Morphogenesis: Morphologic constructions using polygonal discretizations

To consistently coarsen arbitrary unstructured meshes, a computational morphogenesis process is built in conjunction with a numerical method of choice, such as the virtual element method with adaptive meshing. The morphogenesis procedure is performed by clustering elements based on a posteriori error estimation. Additionally, an edge straightening scheme is introduced to reduce the number of nodes and improve accuracy of solutions. The adaptive morphogenesis can be recursively conducted regardless of element type and mesh generation counting. To handle mesh modification events during the morphogenesis, a topology-based data structure is employed, which provides adjacent information on unstructured meshes. Numerical results demonstrate that the adaptive mesh morphogenesis effectively handles mesh coarsening for arbitrarily shaped elements while capturing problematic regions such as those with sharp gradients or singularity.     

Adaptive superposition of finite element meshes in non‐linear transient solid mechanics problems

An s‐adaptive finite element procedure is developed for the transient analysis of 2‐D solid mechanics problems with material non‐linearity due to progressive damage. The resulting adaptive method simultaneously estimates and controls both the spatial error and temporal error within user‐specified tolerances. The spatial error is quantified by the Zienkiewicz–Zhu error estimator and computed via superconvergent patch recovery, while the estimation of temporal error is based on the assumption of a linearly varying third‐order time derivatives of the displacement field in conjunction with direct numerical time integration. The distinguishing characteristic of the s‐adaptive procedure is the use of finite element mesh superposition (s‐refinement) to provide spatial adaptivity. Mesh superposition proves to be particularly advantageous in computationally demanding non‐linear transient problems since it is faster, simpler and more efficient than traditional h‐refinement schemes. Numerical examples are provided to demonstrate the performance characteristics of the s‐adaptive method for quasi‐static and transient problems with material non‐linearity. Copyright © 2007 John Wiley & Sons, Ltd.     

An enhanced cell‐based smoothed finite element method for the analysis of Reissner–Mindlin plate bending problems involving distorted mesh

In this work, an enhanced cell‐based smoothed finite element method (FEM) is presented for the Reissner–Mindlin plate bending analysis. The smoothed curvature computed by a boundary integral along the boundaries of smoothing cells in original smoothed FEM is reformulated, and the relationship between the original approach and the present method in curvature smoothing is established. To improve the accuracy of shear strain in a distorted mesh, we span the shear strain space over the adjacent element. This is performed by employing an edge‐based smoothing technique through a simple area‐weighted smoothing procedure on MITC4 assumed shear strain field. A three‐field variational principle is utilized to develop the mixed formulation. The resultant element formulation is further reduced to a displacement‐based formulation via an assumed strain method defined by the edge‐smoothing technique. As the result, a new formulation consisting of smoothed curvature and smoothed shear strain interpolated by the standard transverse displacement/rotation fields and smoothing operators can be shown to improve the solution accuracy in cell‐based smoothed FEM for Reissner–Mindlin plate bending analysis. Several numerical examples are presented to demonstrate the accuracy of the proposed formulation.Copyright © 2013 John Wiley & Sons, Ltd.