What's the Situation with Intelligent Mesh Generation: A Survey and Perspectives

Intelligent Mesh Generation (IMG) represents a novel and promising field of research, utilizing machine learning techniques to generate meshes. Despite its relative infancy, IMG has significantly broadened the adaptability and practicality of mesh generation techniques, delivering numerous breakthroughs and unveiling potential future pathways. However, a noticeable void exists in the contemporary literature concerning comprehensive surveys of IMG methods. This paper endeavors to fill this gap by providing a systematic and thorough survey of the current IMG landscape. With a focus on 113 preliminary IMG methods, we undertake a meticulous analysis from various angles, encompassing core algorithm techniques and their application scope, agent learning objectives, data types, targeted challenges, as well as advantages and limitations. We have curated and categorized the literature, proposing three unique taxonomies based on key techniques, output mesh unit elements, and relevant input data types. This paper also underscores several promising future research directions and challenges in IMG. To augment reader accessibility, a dedicated IMG project page is available at \url{https://github.com/xzb030/IMG_Survey}

Iterated upwind schemes for gas dynamics

A class of high-resolution schemes established in integration of anelastic equations is extended to fully compressible flows, and documented for unsteady (and steady) problems through a span of Mach numbers from zero to supersonic. The schemes stem from iterated upwind technology of the multidimensional positive definite advection transport algorithm (MPDATA). The derived algorithms employ standard and modified forms of the equations of gas dynamics for conservation of mass, momentum and either total or internal energy as well as potential temperature. Numerical examples from elementary wave-propagation, through computational aerodynamics benchmarks, to atmospheric small- and large-amplitude acoustics with intricate wave-flow interactions verify the approach for both structured and unstructured meshes, and demonstrate its flexibility and robustness

Institute for Computational Mechanics in Propulsion (ICOMP)

The Institute for Computational Mechanics in Propulsion (ICOMP) is a combined activity of Case Western Reserve University, Ohio Aerospace Institute (OAI) and NASA Lewis. The purpose of ICOMP is to develop techniques to improve problem solving capabilities in all aspects of computational mechanics related to propulsion. The activities at ICOMP during 1991 are described

Mesh generation for voxel -based objects

A new physically-based approach to unstructured mesh generation via Monte-Carlo simulation is proposed. Geometrical objects to be meshed are represented by systems of interacting particles with a given interaction potential. A new way of distributing nodes in complex domains is proposed based on a concept of dynamic equilibrium ensemble, which represents a liquid state of matter. The algorithm is simple, numerically stable and produces uniform node distributions in domains of complex geometries and different dimensions. Well-shaped triangles or tetrahedra can be created by connecting a set of uniformly-spaced nodes. The proposed method has many advantages and potential applications.;The new method is applied to the problem of meshing of voxel-based objects. By customizing system potential energy function to reflect surface features, particles can be distributed into desired locations, such as sharp corners and edges. Feature-preserved surface mesh can then be constructed by connecting the node set.;A heuristic algorithm using an advancing front approach is proposed to generate triangulated surface meshes on voxel-based objects. The resultant surface meshes do not inherit the anisotropy of the underlying hexagonal grid. However, the important surface features, such as edges and corners may not be preserved in the mesh.;To overcome this problem, surface features such as edges, corners need to be detected. A new approach of edge capturing is proposed and demonstrated. The approach is based on a Laplace solver with incomplete Jacobi iterations, and as such is very simple and efficient. This edge capturing approach combined with the mesh generation methods above forms a simple and robust technique of unstructured mesh generation on voxel-based objects.;A graphical user interface (GUI) capable of complex geometric design and remote simulation control was implemented. The GUI was used in simulations of large fuel-cell stacks. It enables one to setup, run and monitor simulations remotely through secure shell (SSH2) connections. A voxel-based 3D geometrical modeling module is built along with the GUI. The flexibility of voxel-based geometry representation enables one to use this technique for both geometric design and visualization of volume data

A novel numerical framework for simulation of multiscale spatio-temporally non-linear systems in additive manufacturing processes.

New computationally efficient numerical techniques have been formulated for multi-scale analysis in order to bridge mesoscopic and macroscopic scales of thermal and mechanical responses of a material. These numerical techniques will reduce computational efforts required to simulate metal based Additive Manufacturing (AM) processes. Considering the availability of physics based constitutive models for response at mesoscopic scales, these techniques will help in the evaluation of the thermal response and mechanical properties during layer-by-layer processing in AM. Two classes of numerical techniques have been explored. The first class of numerical techniques has been developed for evaluating the periodic spatiotemporal thermal response involving multiple time and spatial scales at the continuum level. The second class of numerical techniques is targeted at modeling multi-scale multi-energy dissipative phenomena during the solid state Ultrasonic Consolidation process. This includes bridging the mesoscopic response of a crystal plasticity finite element framework at inter- and intragranular scales and a point at the macroscopic scale. This response has been used to develop an energy dissipative constitutive model for a multi-surface interface at the macroscopic scale. An adaptive dynamic meshing strategy as a part of first class of numerical techniques has been developed which reduces computational cost by efficient node element renumbering and assembly of stiffness matrices. This strategy has been able to reduce the computational cost for solving thermal simulation of Selective Laser Melting process by ~100 times. This method is not limited to SLM processes and can be extended to any other fusion based additive manufacturing process and more generally to any moving energy source finite element problem. Novel FEM based beam theories have been formulated which are more general in nature compared to traditional beam theories for solid deformation. These theories have been the first to simulate thermal problems similar to a solid beam analysis approach. These are more general in nature and are capable of simulating general cross-section beams with an ability to match results for complete three dimensional analysis. In addition to this, a traditional Cholesky decomposition algorithm has been modified to reduce the computational cost of solving simultaneous equations involved in FEM simulations. Solid state processes have been simulated with crystal plasticity based nonlinear finite element algorithms. This algorithm has been further sped up by introduction of an interfacial contact constitutive model formulation. This framework has been supported by a novel methodology to solve contact problems without additional computational overhead to incorporate constraint equations averting the usage of penalty springs

Parallel Implementation Of Field Visualizations With High Order Tetrahedral Finite Elements

In the adaptive finite element method (AFEM), high order finite elements are usually used in the computations. In three dimensional simulations, post-processing poses considerable challenge since available data visualization software programs do not accommodate such a high order visualization—common data visualizers can only visualize for up to ten-node tetrahedron elements. This work proposes and implements an efficient framework for data visualization with tetrahedron finite elements having hierarchical basis functions. A general method for post-processing of field data with high order tetrahedra is presented. The method builds upon an approach of the open source visualization software VTK where the data visualizer program ParaView is freely available. By using Red Partitioning of high order elements, the implemented algorithm successfully enables visualization of up to fourth order tetrahedra while using the same data structure for second order tetrahedra as available in ParaView. The results of the implementation clearly show the corresponding increase in accuracy of visualization when the polynomial orders were increased, i.e., the field contour lines are increasingly smoother. Parallelism of the code with the message passing package openMPI was also implemented to increase the computational performance in a multicore computing platform. The results show that computational times taken in the data post-processing significantly decreases when multicore parallel processing is enabled. The developed algorithm was assessed on various problem geometries with considerable high number of unknowns where it is found that the approach is quite scalable

Mesh generation using a correspondence distance field

The central tool of this work is a correspondence distance field to discrete surface points embedded within a quadtree data structure. The theory, development, and implementation of the distance field tool are described, and two main applications to two-dimensional mesh generation are presented with extension to three-dimensional capabilities in mind. First is a method for surface-oriented mesh generation from a sufficiently dense set of discrete surface points without connectivity information. Contour levels of distance from the body are specified and correspondences oriented normally to the contours are created. Regions of merging fronts inside and between objects are detected in the correspondence distance field and incorporated automatically. Second, the boundaries in a Voronoi diagram between specified coordinates are detected adaptively and used to make Delaunay tessellation. Tessellation of regions with holes is performed using ghost nodes. Images of meshed for each method are given for a sample set of test cases. Possible extensions, future work, and CFD applications are also discussed

Doctor of Philosophy

dissertationOne of the fundamental building blocks of many computational sciences is the construction and use of a discretized, geometric representation of a problem domain, often referred to as a mesh. Such a discretization enables an otherwise complex domain to be represented simply, and computation to be performed over that domain with a finite number of basis elements. As mesh generation techniques have become more sophisticated over the years, focus has largely shifted to quality mesh generation techniques that guarantee or empirically generate numerically well-behaved elements. In this dissertation, the two complementary meshing subproblems of vertex placement and element creation are analyzed, both separately and together. First, a dynamic particle system achieves adaptivity over domains by inferring feature size through a new information passing algorithm. Second, a new tetrahedral algorithm is constructed that carefully combines lattice-based stenciling and mesh warping to produce guaranteed quality meshes on multimaterial volumetric domains. Finally, the ideas of lattice cleaving and dynamic particle systems are merged into a unified framework for producing guaranteed quality, unstructured and adaptive meshing of multimaterial volumetric domains

Deformable Simplicial Complexes

In this dissertation we present a novel method for deformable interface tracking in 2D and 3D|deformable simplicial complexes (DSC). Deformable interfaces are used in several applications, such as fluid simulation, image analysis, reconstruction or structural optimization. In the DSC method, the interface (curve in 2D; surface in 3D) is represented explicitly as a piecewise linear curve or surface. However, the domain is also subject to discretization: triangulation in 2D; tetrahedralization in 3D. This way, the interface can be alternatively represented as a set of edges/triangles separating triangles/tetrahedra marked as outside from those marked as inside. Such an approach allows for robust topological adaptivity. Among other advantages of the deformable simplicial complexes there are: space adaptivity, ability to handle and preserve sharp features, possibility for topology control. We demonstrate those strengths in several applications. In particular, a novel, DSC-based fluid dynamics solver has been developed during the PhD project. A special feature of this solver is that due to the fact that DSC maintains an explicit interface representation, surface tension is more easily dealt with. One particular advantage of DSC is the fact that as an alternative to topology adaptivity, topology control is also possible. This is exploited in the construction of cut loci on tori where a front expands from a single point on a torus and stops when it self-intersects