Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh Generation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Update on Development of Mesh Generation Algorithms in MeshKit

MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKit are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.

Jain, Rajeev↗

Spherical geodesic mesh generation

In ALE simulations with moving meshes, mesh topology has a direct influence on feature representation and code robustness. In three-dimensional simulations, modeling spherical volumes and features is particularly challenging for a hydrodynamics code. Calculations on traditional spherical meshes (such as spin meshes) often lead to errors and symmetry breaking. Although the underlying differencing scheme may be modified to rectify this, the differencing scheme may not be accessible. This work documents the use of spherical geodesic meshes to mitigate solution-mesh coupling. These meshes are generated notionally by connecting geodesic surface meshes to produce triangular-prismatic volume meshes. This mesh topology is fundamentally different from traditional mesh topologies and displays superior qualities such as topological symmetry. This work describes the geodesic mesh topology as well as motivating demonstrations with the FLAG hydrocode.

97 MATHEMATICS AND COMPUTING↗

Array-based Hierarchical Mesh Generation in Parallel

In this paper, we describe an array-based hierarchical mesh generation capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial mesh that can be used for a number of purposes such as multi-level methods to generating large meshes. The capability is developed under the parallel mesh framework “Mesh Oriented dAtaBase” a.k.a MOAB. We describe the underlying data structures and algorithms to generate such hierarchies and present numerical results for computational efficiency and mesh quality. In conclusion, we also present results to demonstrate the applicability of the developed capability to a multigrid finite-element solver.

97 MATHEMATICS AND COMPUTING↗

Extraction and applications of skeletons in finite element mesh generation.

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

Grain2Mesh: Mesh Generation for Grain-Scale Nonlinear Elasticity Modeling

The nonlinear hysteretic behavior of rocks under cyclic loading is a crucial area of study in geomechanics. The macroscopic response of a variety of materials has been found to be contingent upon the behavior of the micro-scale structure. This project aims to develop a functional and maintainable software package for generating a multi-phase numerical mesh and accompanying simulation files for finite element modeling used in computational mechanics solvers. Meshes generated from images often lack key preprocessing that reduces noise and prevents mesh element distortion that can increase computational cost. By incorporating user feedback throughout, grain2mesh ensures a high-fidelity mesh that can be used to model grain-scale interactions such as shearing, crack propagation, and interfacial material contrast. Scientific applications of this software include material fracturing, stress-strain analysis for natural and engineered materials, and nonlinear meso-scale analysis.

54 ENVIRONMENTAL SCIENCES↗

Magnetic mesh generation and field line reconstruction for scrape-off layer and divertor modeling in stellarators

The design of divertor targets and baffles for optimal heat and particle exhaust from magnetically confined fusion plasmas requires a combination of fast, low-fidelity models (such as EMC3-Lite (Feng 2022 Plasma Phys. Control. Fusion 64 125012)) for scoping studies and high-fidelity ones (such as EMC3-EIRENE (Feng et al 2014 Contrib. Plasma Phys. 54 426–31)) for verification. Both of those approaches benefit from a magnetic flux tube mesh for fast interpolation and mapping of field line segments (Feng et al 2005 Phys. Plasmas 12 052505). A new automated mesh generator for unstructured quadrilateral flux tubes with adaptive refinement is presented and integrated into FLARE (Frerichs 2024 Nucl. Fusion 64 106034). For HSX with an extended first wall, it is found that several layers of flux tubes can span the entire half field period before splitting is required. This is an advantage over the traditional setup of the EMC3-EIRENE mesh where careful construction of several sub- domains is required already for the much tighter present first wall. In particular, there is no longer the need to manually construct a suitable outer boundary for the mesh. The divide and conquer paradigm with unstructured mesh layout offers a powerful alternative for fast head load approximation that is suitable for integration into optimization workflows. Further examples for W7-X and CTH demonstrate the versatile application range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Issues in Equation of State data generation for Hot Dense MatterA Note on Generalized Radial Mesh Generation for Plasma Electronic Structure

Precise electronic structure calculations of ions in plasmas benefit from optimized numerical radial meshes. A new closed form expression for obtaining non-linear parameters for the efficient generation of analytic log-linear radial meshes is presented. In conjunction with the (very simple) algorithm for the rapid high precision evaluation of Lambert's W-function, the above identity allows the precise construction of generalized log-linear radial meshes adapted to various constraints.

74 ATOMIC AND MOLECULAR PHYSICS↗

Documentation for MeshKit - Reactor Geometry (&mesh) Generator

This report gives documentation for using MeshKit’s Reactor Geometry (and mesh) Generator (RGG) GUI and also briefly documents other algorithms and tools available in MeshKit. RGG is a program designed to aid in modeling and meshing of complex/large hexagonal and rectilinear reactor cores. RGG uses Argonne’s SIGMA interfaces, Qt and VTK to produce an intuitive user interface. By integrating a 3D view of the reactor with the meshing tools and combining them into one user interface, RGG streamlines the task of preparing a simulation mesh and enables real-time feedback that reduces accidental scripting mistakes that could waste hours of meshing. RGG interfaces with MeshKit tools to consolidate the meshing process, meaning that going from model to mesh is as easy as a button click. This report is designed to explain RGG v 2.0 interface and provide users with the knowledge and skills to pilot RGG successfully. Brief documentation of MeshKit source code, tools and other algorithms available are also presented for developers to extend and add new algorithms to MeshKit. RGG tools work in serial and parallel and have been used to model complex reactor core models consisting of conical pins, load pads, several thousands of axially varying material properties of instrumentation pins and other interstices meshes.

Jain, Rajeev↗

Cubit Mesh Generation Toolkit V11.1

CUBIT prepares models to be used in computer-based simulation of real-world events. CUBIT is a full-featured software toolkit for robust generation of two- and three-dimensional finite element meshes (grids) and geometry preparation. Its main goal is to reduce the time to generate meshes, particularly large hex meshes of complicated, interlocking assemblies.

HANKS, BYRON↗

Mesh generation and energy group condensation studies for the jaguar deterministic transport code

The deterministic transport code Jaguar is introduced, and the modeling process for Jaguar is demonstrated using a two-dimensional assembly model of the Hoogenboom-Martin Performance Benchmark Problem. This single assembly model is being used to test and analyze optimal modeling methodologies and techniques for Jaguar. This paper focuses on spatial mesh generation and energy condensation techniques. In this summary, the models and processes are defined as well as thermal flux solution comparisons with the Monte Carlo code MC21. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Extending a CAD-Based Cartesian Mesh Generator for the Lattice Boltzmann Method

This paper describes the development of a custom preprocessor for the PaRAllel Thermal Hydraulics simulations using Advanced Mesoscopic methods (PRATHAM) code based on an open-source mesh generator, CartGen [1]. PRATHAM is a three-dimensional (3D) lattice Boltzmann method (LBM) based parallel flow simulation software currently under development at the Oak Ridge National Laboratory. The LBM algorithm in PRATHAM requires a uniform, coordinate system-aligned, non-body-fitted structured mesh for its computational domain. CartGen [1], which is a GNU-licensed open source code, already comes with some of the above needed functionalities. However, it needs to be further extended to fully support the LBM specific preprocessing requirements. Therefore, CartGen is being modified to (i) be compiler independent while converting a neutral-format STL (Stereolithography) CAD geometry to a uniform structured Cartesian mesh, (ii) provide a mechanism for PRATHAM to import the mesh and identify the fluid/solid domains, and (iii) provide a mechanism to visually identify and tag the domain boundaries on which to apply different boundary conditions.

Cartesian Grid↗

Unconstrained plastering : all-hexahedral mesh generation via advancing front geometry decomposition (2004-2008).

The generation of all-hexahedral finite element meshes has been an area of ongoing research for the past two decades and remains an open problem. Unconstrained plastering is a new method for generating all-hexahedral finite element meshes on arbitrary volumetric geometries. Starting from an unmeshed volume boundary, unconstrained plastering generates the interior mesh topology without the constraints of a pre-defined boundary mesh. Using advancing fronts, unconstrained plastering forms partially defined hexahedral dual sheets by decomposing the geometry into simple shapes, each of which can be meshed with simple meshing primitives. By breaking from the tradition of previous advancing-front algorithms, which start from pre-meshed boundary surfaces, unconstrained plastering demonstrates that for the tested geometries, high quality, boundary aligned, orientation insensitive, all-hexahedral meshes can be generated automatically without pre-meshing the boundary. Examples are given for meshes from both solid mechanics and geotechnical applications.

97 MATHEMATICS AND COMPUTING↗

Sculpt: Automatic Parallel Hexahedral Mesh Generation

Sculpt is a companion application to Cubit designed to run in parallel for generating all-hex meshes of complex geometry. It uses a unique overlay-grid procedure that extracts surfaces from a volume-fraction representation of the geometry. This allows for fast, automatic, fault-tolerant meshing in a high-performance computing (HPC) environment. Although Sculpt can be driven from Cubit as a GUI front-end, Sculpt was developed as a separate application so that it can be run independently from Cubit on HPC computing platforms. It was also designed as a separable software library so it can be easily integrated as an in-situ meshing solution within other codes. This work provides a brief technical discussion of the algorithms used in Sculpt as well as a complete user's manual. It includes details of the Cubit interface to Sculpt and the complete manual for the stand-alone application, including examples.

97 MATHEMATICS AND COMPUTING↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Volumetric analysis and mesh generation of real and artificial microstructural geometries

Producing a viable finite element mesh of realistic microstructural structural geometry is a critical step in analyzing the thermo-mechanical behavior of complex multi-material composites. Advancements in imaging technology such as micro computed tomography have allowed modelers to access high resolution mesoscale geometries for direct numerical simulation. However, converting from voxel based 3D images to usable finite element meshes has been challenging. A robust method including algorithms and software scripts for generating finite element meshes from 3D imaged microstructures is presented in this paper. It includes a routine for inserting cohesive elements around material interfaces to enable modeling of interface properties including delamination and damage. The algorithms and procedures presented in this method leverage currently available software packages for processing surface based geometry into volume based meshes. In addition to converting real geometry from physical imaging systems, algorithms for producing numerically generated and statistically equivalent microstructural geometry are also included. These artificial microstructures can be a valuable resource for modelers when physical specimens do not exist or are limited in quantity: Method establishes a workflow from voxel data to viable finite element mesh including interface information, and Includes a method for synthetic geometry generation based on metrics from real microstructures.

36 MATERIALS SCIENCE↗