Quality improvements in extruded meshes using topologically adaptive generalized elements

This paper describes a method to extrude near‐body volume meshes that exploits topologically adaptive generalized elements to improve local mesh quality. Specifically, an advancing layer algorithm for extruding volume meshes from surface meshes of arbitrary topology, appropriate for viscous fluid flows, is discussed. First, a two‐layer reference mesh is generated from the layer initial surface mesh by extruding along the local surface normals. The reference mesh is then smoothed using a Poisson equation. Local quality improvement operations such as edge collapse, face refinement, and local reconnection are performed in each layer to drive the mesh toward isotropy and improve the transition from the extruded mesh to a void‐filling tetrahedral mesh. A few example meshes along with quality plots are presented to demonstrate the efficacy of this approach. Copyright © 2004 John Wiley & Sons, Ltd.     

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.     

Octree‐based reasonable‐quality hexahedral mesh generation using a new set of refinement templates

An octree‐based mesh generation method is proposed to create reasonable‐quality, geometry‐adapted unstructured hexahedral meshes automatically from triangulated surface models without any sharp geometrical features. A new, easy‐to‐implement, easy‐to‐understand set of refinement templates is developed to perform local mesh refinement efficiently even for concave refinement domains without creating hanging nodes. A buffer layer is inserted on an octree core mesh to improve the mesh quality significantly. Laplacian‐like smoothing, angle‐based smoothing and local optimization‐based untangling methods are used with certain restrictions to further improve the mesh quality. Several examples are shown to demonstrate the capability of our hexahedral mesh generation method for complex geometries. Copyright © 2008 John Wiley & Sons, Ltd.     

Mesh refinement strategies without mapping of nonlinear solutions for the generalized and standard FEM analysis of 3‐D cohesive fractures

A robust and efficient strategy is proposed to simulate mechanical problems involving cohesive fractures. This class of problems is characterized by a global structural behavior that is strongly affected by localized nonlinearities at relatively small‐sized critical regions. The proposed approach is based on the division of a simulation into a suitable number of sub‐simulations where adaptive mesh refinement is performed only once based on refinement window(s) around crack front process zone(s). The initialization of Newton‐Raphson nonlinear iterations at the start of each sub‐simulation is accomplished by solving a linear problem based on a secant stiffness, rather than a volume mapping of nonlinear solutions between meshes. The secant stiffness is evaluated using material state information stored/read on crack surface facets which are employed to explicitly represent the geometry of the discontinuity surface independently of the volume mesh within the generalized finite element method framework. Moreover, a simplified version of the algorithm is proposed for its straightforward implementation into existing commercial software. Data transfer between sub‐simulations is not required in the simplified strategy. The computational efficiency, accuracy, and robustness of the proposed strategies are demonstrated by an application to cohesive fracture simulations in 3‐D. Copyright © 2016 John Wiley & Sons, Ltd.     

Elimination of spurious static modes in meshes of hybrid compatible triangular and tetrahedral finite elements

In the assumed displacement, or primal, hybrid finite element method, the requirements of continuity of displacements across the sides are regarded as constraints, imposed using Lagrange multipliers. In this paper, such a formulation for linear elasticity, in which the polynomial approximation functions are not associated with nodes, is presented. Elements with any number of sides may be easily used to create meshes with irregular vertices, when performing a non‐uniform h‐refinement. Meshes of non‐uniform degree may be easily created, when performing an hp‐refinement. The occurrence of spurious static modes in meshes of triangular elements, when compatibility is strongly enforced, is discussed. An algorithm for the automatic selection, based on the topology of a mesh of triangular elements, of the sides in which to decrease the degree of the approximation functions, in order to eliminate all these spurious modes and preserve compatibility, is presented. A similar discussion is presented for the occurrence of spurious static modes in meshes of tetrahedral elements. An algorithm, based on heuristic criteria, that succeeded in eliminating these spurious modes and preserving compatibility in all the meshes of tetrahedral elements of uniform degree that were tested, is also presented. Copyright © 2001 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.     

Common‐refinement‐based data transfer between non‐matching meshes in multiphysics simulations

In multiphysics simulations using a partitioned approach, each physics component solves on its own mesh, and the interfaces between these meshes are in general non‐matching. Simulation data (e.g. jump conditions) must be exchanged across the interface meshes between physics components. It is highly desirable for such data transfers to be both numerically accurate and physically conservative. This paper presents accurate, conservative, and efficient data transfer algorithms utilizing a common refinement of two non‐matching surface meshes. Our methods minimize errors in a certain norm while achieving strict conservation. Some traditional methods for data transfer and related problems are also reviewed and compared with our methods. Numerical results demonstrate significant advantages of common‐refinement based methods, especially for repeated transfers. While the comparisons are performed with matching geometries, this paper also addresses additional complexities associated with non‐matching surface meshes and presents some experimental results from 3‐D simulations using our methods. Copyright © 2004 John Wiley & Sons, Ltd.     

Tetrahedral mesh generation using Delaunay refinement with non‐standard quality measures

This paper studies the practical performance of Delaunay refinement tetrahedral mesh generation algorithms. By using non‐standard quality measures to drive refinement, we show that sliver tetrahedra can be eliminated from constrained Delaunay tetrahedralizations solely by refinement. Despite the fact that quality guarantees cannot be proven, the algorithm can consistently generate meshes with dihedral angles between 18^circ and 154^°. Using a fairer quality measure targeting every type of bad tetrahedron, dihedral angles between 14^° and 154^° can be obtained. The number of vertices inserted to achieve quality meshes is comparable to that needed when driving refinement with the standard circumradius‐to‐shortest‐edge ratio. We also study the use of mesh improvement techniques on Delaunay refined meshes and observe that the minimum dihedral angle can generally be pushed above 20^°, regardless of the quality measure used to drive refinement. The algorithm presented in this paper can accept geometric domains whose boundaries are piecewise smooth. Copyright © 2011 John Wiley & Sons, Ltd.     

Optimization of a regularized distortion measure to generate curved high‐order unstructured tetrahedral meshes

We present a robust method for generating high‐order nodal tetrahedral curved meshes. The approach consists of modifying an initial linear mesh by first, introducing high‐order nodes, second, displacing the boundary nodes to ensure that they are on the computer‐aided design surface, and third, smoothing and untangling the mesh obtained after the displacement of the boundary nodes to produce a valid curved high‐order mesh. The smoothing algorithm is based on the optimization of a regularized measure of the mesh distortion relative to the original linear mesh. This means that whenever possible, the resulting mesh preserves the geometrical features of the initial linear mesh such as shape, stretching, and size. We present several examples to illustrate the performance of the proposed algorithm. Furthermore, the examples show that the implementation of the optimization problem is robust and capable of handling situations in which the mesh before optimization contains a large number of invalid elements. We consider cases with polynomial approximations up to degree ten, large deformations of the curved boundaries, concave boundaries, and highly stretched boundary layer elements. The meshes obtained are suitable for high‐order finite element analyses. Copyright © 2015 John Wiley & Sons, Ltd.     

An algorithm for adaptive refinement of triangular element meshes

A simple algorithm is developed for adaptive and automatic h refinement of two-dimensional triangular finite element meshes. The algorithm is based on an element refinement ratio that can be calculated from an a posteriori error indicator. The element subdivision algorithm is robust and recursive. Smooth transition between large and small elements is achieved without significant degradation of the aspect ratio of the elements in the mesh. Several example problems are presented to illustrate the utility of the approach.     

Three‐dimensional grayscale‐free topology optimization using a level‐set based r‐refinement method

In this paper, we propose a three‐dimensional (3D) grayscale‐free topology optimization method using a conforming mesh to the structural boundary, which is represented by the level‐set method. The conforming mesh is generated in an r‐refinement manner; that is, it is generated by moving the nodes of the Eulerian mesh that maintains the level‐set function. Although the r‐refinement approach for the conforming mesh generation has many benefits from an implementation aspect, it has been considered as a difficult task to stably generate 3D conforming meshes in the r‐refinement manner. To resolve this task, we propose a new level‐set based r‐refinement method. Its main novelty is a procedure for minimizing the number of the collapsed elements whose nodes are moved to the structural boundary in the conforming mesh; in addition, we propose a new procedure for improving the quality of the conforming mesh, which is inspired by Laplacian smoothing. Because of these novelties, the proposed r‐refinement method can generate 3D conforming meshes at a satisfactory level, and 3D grayscale‐free topology optimization is realized. The usefulness of the proposed 3D grayscale‐free topology optimization method is confirmed through several numerical examples. Copyright © 2017 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.     

Towards automatic structured multiblock mesh generation using improved transfinite interpolation

The quality of any numerical flowfield solution is inextricably linked to the quality of the mesh used. It is normally accepted that structured meshes are of higher quality than unstructured meshes, but are much more difficult to generate and, furthermore, for complex topologies a multiblock approach is required. This is the most resource‐intensive approach to mesh generation, since block structures, mesh point distributions, etc., need to be defined before the generation process, and so is seldom used in an industrial design loop, particularly where a novice user may be involved. This paper considers and presents two significant advances in multiblock mesh generation: the development of a fast, robust, and improved quality interpolation‐based generation scheme and a fully automatic multiblock optimization and generation method. A volume generation technique is presented based on a form of transfinite interpolation, but modified to include improved orthogonality and spacing control and, more significantly, an aspect ratio‐based smoothing algorithm that removes grid crossover and results in smooth meshes even for discontinuous boundary distributions. A fully automatic multiblock generation scheme is also presented, which only requires surface patch(es) and a target number of mesh cells. Hence, all user input is removed from the process, and a novice user is able to obtain a high‐quality mesh in a few minutes. It also means the code can be run in batch mode, or called as an external function, and so is ideal for incorporation into a design or optimization loop. To demonstrate the power and efficiency of the code, multiblock meshes of up to 256 million cells are presented for wings and rotors in hover and forward flight. Copyright © 2007 John Wiley & Sons, Ltd.     

A distortion measure to validate and generate curved high‐order meshes on CAD surfaces with independence of parameterization

A framework to validate and generate curved nodal high‐order meshes on Computer‐Aided Design (CAD) surfaces is presented. The proposed framework is of major interest to generate meshes suitable for thin‐shell and 3D finite element analysis with unstructured high‐order methods. First, we define a distortion (quality) measure for high‐order meshes on parameterized surfaces that we prove to be independent of the surface parameterization. Second, we derive a smoothing and untangling procedure based on the minimization of a regularization of the proposed distortion measure. The minimization is performed in terms of the parametric coordinates of the nodes to enforce that the nodes slide on the surfaces. Moreover, the proposed algorithm repairs invalid curved meshes (untangling), deals with arbitrary polynomial degrees (high‐order), and handles with low‐quality CAD parameterizations (independence of parameterization). Third, we use the optimization procedure to generate curved nodal high‐order surface meshes by means of an a posteriori approach. Given a linear mesh, we increase the polynomial degree of the elements, curve them to match the geometry, and optimize the location of the nodes to ensure mesh validity. Finally, we present several examples to demonstrate the features of the optimization procedure, and to illustrate the surface mesh generation process. Copyright © 2015 John Wiley & Sons, Ltd.     

The tetrahedral finite cell method: Higher‐order immersogeometric analysis on adaptive non‐boundary‐fitted meshes

The finite cell method (FCM) is an immersed domain finite element method that combines higher‐order non‐boundary‐fitted meshes, weak enforcement of Dirichlet boundary conditions, and adaptive quadrature based on recursive subdivision. Because of its ability to improve the geometric resolution of intersected elements, it can be characterized as an immersogeometric method. In this paper, we extend the FCM, so far only used with Cartesian hexahedral elements, to higher‐order non‐boundary‐fitted tetrahedral meshes, based on a reformulation of the octree‐based subdivision algorithm for tetrahedral elements. We show that the resulting TetFCM scheme is fully accurate in an immersogeometric sense, that is, the solution fields achieve optimal and exponential rates of convergence for h‐refinement and p‐refinement, if the immersed geometry is resolved with sufficient accuracy. TetFCM can leverage the natural ability of tetrahedral elements for local mesh refinement in three dimensions. Its suitability for problems with sharp gradients and highly localized features is illustrated by the immersogeometric phase‐field fracture analysis of a human femur bone. Copyright © 2016 John Wiley & Sons, Ltd.     

Marching volume polytopes algorithm

This paper presents an algorithm for the refinement of two- or three-dimensional meshes with respect to an implicitly given domain, so that its surface is approximated by facets of the resulting polytopes. Using a Cartesian grid, the proposed algorithm may be used as a mesh generator. Initial meshes may consist of polytopes such as quadrilaterals and triangles, as well as hexahedrons, pyramids, and tetrahedrons. Given the ability to compute edge intersections with the surface of an implicitly given domain, the proposed marching volume polytopes algorithm uses predefined refinement patterns applied to individual polytopes depending on the intersection pattern of their edges. The refinement patterns take advantage of rotational symmetry. Since these patterns are applied independently to individual polytopes, the resulting mesh may encompass the so-called orientation problem, where two adjacent polytopes are rotated against one another. To allow for a repeated application of the marching volume polytopes algorithm, the proposed data structures and algorithms account for this ambiguity. A simple example illustrates the advantage of the repeated application of the proposed algorithm to approximate domains with sharp corners. Furthermore, finite element simulations for two challenging real-world problems, which require highly accurate approximations of the considered domains, demonstrate its applicability. For these simulations, a variant of the fictitious domain method is used.     

Inserting a surface into an existing unstructured mesh

In this work, a new method for inserting a surface as an internal boundary into an existing unstructured tetrahedral mesh is developed. The surface is discretized by initially placing vertices on its bounding curves, defining a length scale at every location on each boundary curve based on the local underlying mesh, and equidistributing length scale along these curves between vertices. The surface is then sampled based on this boundary discretization, resulting in a surface mesh spaced in a way that is consistent with the initial mesh. The new points are then inserted into the mesh, and local refinement is performed, resulting in a final mesh containing a representation of the surface while preserving mesh quality. The advantage of this algorithm over generating a new mesh from scratch is in allowing for the majority of existing simulation data to be preserved and not have to be interpolated onto the new mesh. This algorithm is demonstrated in two and three dimensions on problems with and without intersections with existing internal boundaries. Copyright © 2015 John Wiley & Sons, Ltd.     

Robust generation of high‐quality unstructured meshes on realistic biomedical geometry

In this paper, we propose efficient and robust unstructured mesh generation methods based on computed tomography (CT) and magnetic resonance imaging (MRI) data, in order to obtain a patient‐specific geometry for high‐fidelity numerical simulations. Surface extraction from medical images is carried out mainly using open source libraries, including the Insight Segmentation and Registration Toolkit and the Visualization Toolkit, into the form of facet surface representation. To create high‐quality surface meshes, we propose two approaches. One is a direct advancing front method, and the other is a modified decimation method. The former emphasizes the controllability of local mesh density, and the latter enables semi‐automated mesh generation from low‐quality discrete surfaces. An advancing‐front‐based volume meshing method is employed. Our approaches are demonstrated with high‐fidelity tetrahedral meshes around medical geometries extracted from CT/MRI data. Copyright © 2005 John Wiley & Sons, Ltd.     

Topology optimization using a continuous density field and adaptive mesh refinement

A new method of topology optimization is introduced in which a continuous material field is combined with adaptive mesh refinement. Using a continuous material field with different analysis and design meshes allows the method to produce optimal designs that are free of numerical artifacts like checkerboard patterns and material islands. Adaptive mesh refinement is then applied to both meshes to precisely locate the optimal boundary of the final structure. A Helmholtz‐type density filter is used to prevent the appearance of small topological features as the mesh refinement proceeds. Results are presented for several test problems, including problems with geometrically complex domain boundaries.     

Quality improvement of non‐manifold hexahedral meshes for critical feature determination of microstructure materials

This paper describes a novel approach to improve the quality of non‐manifold hexahedral meshes with feature preservation for microstructure materials. In earlier works, we developed an octree‐based isocontouring method to construct unstructured hexahedral meshes for domains with multiple materials by introducing the notion of material change edge to identify the interface between two or more materials. However, quality improvement of non‐manifold hexahedral meshes is still a challenge. In the present algorithm, all the vertices are categorized into seven groups, and then a comprehensive method based on pillowing, geometric flow and optimization techniques is developed for mesh quality improvement. The shrink set in the modified pillowing technique is defined automatically as the boundary of each material region with the exception of local non‐manifolds. In the relaxation‐based smoothing process, non‐manifold points are identified and fixed. Planar boundary curves and interior spatial curves are distinguished, and then regularized using B‐spline interpolation and resampling. Grain boundary surface patches and interior vertices are improved as well. Finally, the optimization method eliminates negative Jacobians of all the vertices. We have applied our algorithms to two beta titanium data sets, and the constructed meshes are validated via a statistics study. Finite element analysis of the 92‐grain titanium is carried out based on the improved mesh, and compared with the direct voxel‐to‐element technique. Copyright © 2009 John Wiley & Sons, Ltd.