Tetrahedral mesh improvement by shell transformation

Existing flips for tetrahedral meshes simply make a selection from a few possible configurations within a single shell (i.e., a polyhedron that can be filled up with a mesh composed of a set of elements that meet each other at one edge), and their effectiveness is usually confined. A new topological operation for tetrahedral meshes named shell transformation is proposed. Its recursive callings execute a sequence of shell transformations on neighboring shells, acting like composite edge removal transformations. Such topological transformations are able to perform on a much larger element set than that of a single flip, thereby leading the way towards a better local optimum solution. Hence, a new mesh improvement algorithm is developed by combining this recursive scheme with other schemes, including smoothing, point insertion and point suppression. Numerical experiments reveal that the proposed algorithm can well balance some stringent and yet sometimes even conflict requirements of mesh improvement, i.e., resulting in high-quality meshes and reducing computing time at the same time. Therefore, it can be used for mesh quality improvement tasks involving millions of elements, in which it is essential not only to generate high-quality meshes, but also to reduce total computational time for mesh improvement

Geodynamo and mantle convection simulations on the Earth Simulator using the Yin-Yang grid

We have developed finite difference codes based on the Yin-Yang grid for the geodynamo simulation and the mantle convection simulation. The Yin-Yang grid is a kind of spherical overset grid that is composed of two identical component grids. The intrinsic simplicity of the mesh configuration of the Yin-Yang grid enables us to develop highly optimized simulation codes on massively parallel supercomputers. The Yin-Yang geodynamo code has achieved 15.2 Tflops with 4096 processors on the Earth Simulator. This represents 46% of the theoretical peak performance. The Yin-Yang mantle code has enabled us to carry out mantle convection simulations in realistic regimes with a Rayleigh number of $10^7$ including strongly temperature-dependent viscosity with spatial contrast up to $10^6$.Comment: Plenary talk at SciDAC 200

An improved local remeshing algorithm for moving boundary problems

© 2016 The Author(s). Three issues are tackled in this study to improve the robustness of local remeshing techniques. Firstly, the local remeshing region (hereafter referred to as ‘hole’) is initialized by removing low-quality elements and then continuously expanded until a certain element quality is reached after remeshing. The effect of the number of the expansion cycle on the hole size and element quality after remeshing is experimentally analyzed. Secondly, the grid sources for element size control are attached to moving bodies and will move along with their host bodies to ensure reasonable grid resolution inside the hole. Thirdly, the boundary recovery procedure of a Delaunay grid generation approach is enhanced by a new grid topology transformation technique (namely shell transformation) so that the new grid created inside the hole is therefore free of elements of extremely deformed/skewed shape, whilst also respecting the hole boundary. The proposed local remeshing algorithm has been integrated with an in-house unstructured grid-based simulation system for solving moving boundary problems. The robustness and accuracy of the developed local remeshing technique are successfully demonstrated via industry-scale applications for complex flow simulations

A Parallel Local Reconnection Approach for Tetrahedral Mesh Improvement

AbstractA multi-threaded parallel local reconnection algorithm is proposed for tetrahedral meshes. It defines a feature point within the region involved in each operation, and sorts the features points along a Hilbert curve. The decomposition of this Hilbert curve results in a load-balanced distribution of local operations. Meanwhile, the regions of concurrently executed local operations are separated far away, such that the possibility of interference is reduced to a very low level. Finally, a parallel mesh improver is developed by combining the proposed algorithm with a parallel mesh smoothing algorithm, and its effectiveness and efficiency is verified in various numerical experiments

A semi-structured approach to curvilinear mesh generation around streamlined bodies

We present an approach for robust high-order mesh generation specially tailored to streamlined bodies. The method is based on a semi-sructured approach which combines the high quality of structured meshes in the near-field with the flexibility of unstructured meshes in the far-field. We utilise medial axis technology to robustly partition the near-field into blocks which can be meshed coarsely with a linear swept mesher. A high-order mesh of the near-field is then generated and split using an isoparametric approach which allows us to obtain highly stretched elements aligned with the flow field. Special treatment of the partition is performed on the wing root juntion and the trailing edge --- into the wake --- to obtain an H-type mesh configuration with anisotropic hexahedra ideal for the strong shear of high Reynolds number simulations. We then proceed to discretise the far-field using traditional robust tetrahedral meshing tools. This workflow is made possible by two sets of tools: CADfix, focused on CAD system, the block partitioning of the near-field and the generation of a linear mesh; and NekMesh, focused on the curving of the high-order mesh and the generation of highly-stretched boundary layer elements. We demonstrate this approach on a NACA0012 wing attached to a wall and show that a gap between the wake partition and the wall can be inserted to remove the dependency of the partitioning procedure on the local geometry.Comment: Preprint accepted to the 2019 AIAA Aerospace Sciences Meetin

Tetrahedral Meshes in Biomedical Applications: Generation, Boundary Recovery and Quality Enhancements

Mesh generation is a fundamental precursor to finite element implementations for solution of partial differential equations in engineering and science. This dissertation advances the field in three distinct but coupled areas. A robust and fast three dimensional mesh generator for arbitrarily shaped geometries was developed. It deploys nodes throughout the domain based upon user-specified mesh density requirements. The system is integer and pixel based which eliminates round off errors, substantial memory requirements and cpu intensive calculations. Linked, but fully detachable, to the mesh generation system is a physical boundary recovery routine. Frequently, the original boundary topology is required for specific boundary condition applications or multiple material constraints. Historically, this boundary preservation was not available. An algorithm was developed, refined and optimized that recovers the original boundaries, internal and external, with fidelity. Finally, a node repositioning algorithm was developed that maximizes the minimum solid angle of tetrahedral meshes. The highly coveted 2D Delaunay property that maximizes the minimum interior angle of a triangle mesh does not extend to its 3D counterpart, to maximize the minimum solid angle of a tetrahedron mesh. As a consequence, 3D Delaunay created meshes have unacceptable sliver tetrahedral elements albeit composed of 4 high quality triangle sides. These compromised elements are virtually unavoidable and can foil an otherwise intact mesh. The numerical optimization routine developed takes any preexisting tetrahedral mesh and repositions the nodes without changing the mesh topology so that the minimum solid angle of the tetrahedrons is maximized. The overall quality enhancement of the volume mesh might be small, depending upon the initial mesh. However, highly distorted elements that create ill-conditioned global matrices and foil a finite element solver are enhanced significantly