Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Geometry meshing”

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 307 records · Page 17

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↗

[Skeleton extractions and applications].

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↗

Replace Human Intelligence with Fast and Smart Geometric Reasoning and Graph Neural Network to Accelerate Next Gen ModSim Workflows

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

97 MATHEMATICS AND COMPUTING↗

Closing the Loop between In Situ Stress Complexity and EGS Fracture Complexity

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

42 ENGINEERING↗

A Python Script to Convert MCNP Unstructured Mesh Elemental Edit Output Files to XML-based VTK Files

This report provides a Python script to convert an MCNP® ASCII unstructured mesh (UM) elemental edit output (EEOUT) file geometry and results to an ASCII XML-based unstructured mesh VTK (.vtu) file. The resulting VTK file can be directly visualized with applications such as ParaView and VisIt. This report also describes accompanying verification work that shows the script performing as required. However, users of the enclosed script must still verify that the script is behaving correctly for their own work.

97 MATHEMATICS AND COMPUTING↗

PVmesh [SWR-24-123]

PVmesh is an open-source Python tool for generating high-fidelity, adaptive finite-element meshes for photovoltaic modules. It supports multilayer panel geometries, frame details, and mounting zones that are often difficult to mesh robustly with generic workflows. Built on Gmsh, PVmesh automates geometry construction, partitioning, domain/boundary tagging, and export for downstream finite-element solvers.

He, Xin [National Laboratory of the Rockies (NLR),↗

An Agile Design-to-Simulation Workflow Using a New Conforming Moving Least Squares Method

This report summarizes the accomplishments and challenges of a two year LDRD effort focused on improving design-to-simulation agility. The central bottleneck in most solid mechanics simulations is the process of taking CAD geometry and creating a discretization of suitable quality, i.e., the "meshing" effort. This report revisits meshfree methods and documents some key advancements that allow their use on problems with complex geometries, low quality meshes, nearly incompressible materials or that involve fracture. The resulting capability was demonstrated to be an effective part of an agile simulation process by enabling rapid discretization techniques without increasing the time to obtain a solution of a given accuracy. The first enhancement addressed boundary-related challenges associated with meshfree methods. When using point clouds and Euclidean metrics to construct approximation spaces, the boundary information is lost, which results in low accuracy solutions for non-convex geometries and mate rial interfaces. This also complicates the application of essential boundary conditions. The solution involved the development of conforming window functions which use graph and boundary information to directly incorporate boundaries into the approximation space.

42 ENGINEERING↗

Physics demonstration and verification of MOOSE framework reactor module meshing capabilities

The recently developed Reactor module in the open-source MOOSE framework includes finite element meshing capabilities for analysis of common reactor geometries. Capabilities in the Reactor module have been employed to generate meshes for physics applications including a sodium-cooled fast reactor core analysis using Griffin, a fast reactor assembly thermal deformation analysis using MOOSE Tensor Mechanics, and a heat-pipe cooled microreactor coupled analysis using Griffin, Bison, and Sockeye. The process to build these meshes using MOOSE's meshing capabilities is described. Physics simulation results using MOOSE-based meshes have been verified to match results which leverage external meshing software such as Cubit or Argonne's Mesh Tools. MOOSE's Reactor module provides significant advantages compared to the use of external meshing tools when analyzing Cartesian and hexagonal reactor lattices using MOOSE-based applications: accessibility to the end user, low barrier to entry for new users, speed of mesh generation, volume preservation of meshed fuel pins, and simplification of analysis workflow when using MOOSE applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Implicit mesh discontinuous Galerkin methods and interfacial gauge methods for high-order accurate interface dynamics, with applications to surface tension dynamics, rigid body fluid–structure interaction, and free surface flow: Part II

Here, in this two-part paper, a high-order accurate implicit mesh discontinuous Galerkin (dG) framework is developed for fluid interface dynamics, facilitating precise computation of interfacial fluid flow in evolving geometries. The framework uses implicitly defined meshes—wherein a reference quadtree or octree grid is combined with an implicit representation of evolving interfaces and moving domain boundaries—and allows physically prescribed interfacial jump conditions to be imposed or captured with high-order accuracy. Part one discusses the design of the framework, including: (i) high-order quadrature for implicitly defined elements and faces; (ii) high-order accurate discretisation of scalar and vector-valued elliptic partial differential equations with interfacial jumps in ellipticity coefficient, leading to optimal-order accuracy in the maximum norm and discrete linear systems that are symmetric positive (semi)definite; (iii) the design of incompressible fluid flow projection operators, which except for the influence of small penalty parameters, are discretely idempotent; and (iv) the design of geometric multigrid methods for elliptic interface problems on implicitly defined meshes and their use as preconditioners for the conjugate gradient method. Also discussed is a variety of aspects relating to moving interfaces, including: (v) dG discretisations of the level set method on implicitly defined meshes; (vi) transferring state between evolving implicit meshes; (vii) preserving mesh topology to accurately compute temporal derivatives; (viii) high-order accurate reinitialisation of level set functions; and (ix) the integration of adaptive mesh refinement. In part two, several applications of the implicit mesh dG framework in two and three dimensions are presented, including examples of single phase flow in nontrivial geometry, surface tension-driven two phase flow with phase-dependent fluid density and viscosity, rigid body fluid–structure interaction, and free surface flow. A class of techniques known as interfacial gauge methods is adopted to solve the corresponding incompressible Navier–Stokes equations, which, compared to archetypical projection methods, have a weaker coupling between fluid velocity, pressure, and interface position, and allow high-order accurate numerical methods to be developed more easily. Convergence analyses conducted throughout the work demonstrate high-order accuracy in the maximum norm for all of the applications considered; for example, fourth-order spatial accuracy in fluid velocity, pressure, and interface location is demonstrated for surface tension-driven two phase flow in 2D and 3D. Specific application examples include: vortex shedding in nontrivial geometry, capillary wave dynamics revealing fine-scale flow features, falling rigid bodies tumbling in unsteady flow, and free surface flow over a submersed obstacle, as well as high Reynolds number soap bubble oscillation dynamics and vortex shedding induced by a type of Plateau–Rayleigh instability in water ripple free surface flow. In these last two examples compare numerical results with experimental data and serve as an additional means of validation; they also reveal physical phenomena not visible in the experiments, highlight how small-scale interfacial features develop and affect macroscopic dynamics, and demonstrate the wide range of spatial scales often at play in interfacial fluid flow.

97 MATHEMATICS AND COMPUTING↗

Implicit mesh discontinuous Galerkin methods and interfacial gauge methods for high-order accurate interface dynamics, with applications to surface tension dynamics, rigid body fluid–structure interaction, and free surface flow: Part I

In this two-part paper, a high-order accurate implicit mesh discontinuous Galerkin (dG) framework is developed for fluid interface dynamics, facilitating precise computation of interfacial fluid flow in evolving geometries. The framework uses implicitly defined meshes—wherein a reference quadtree or octree grid is combined with an implicit representation of evolving interfaces and moving domain boundaries—and allows physically prescribed interfacial jump conditions to be imposed or captured with high-order accuracy. Part one discusses the design of the framework, including: (i) high-order quadrature for implicitly defined elements and faces; (ii) high-order accurate discretisation of scalar and vector-valued elliptic partial differential equations with interfacial jumps in ellipticity coefficient, leading to optimal-order accuracy in the maximum norm and discrete linear systems that are symmetric positive (semi)definite; (iii) the design of incompressible fluid flow projection operators, which except for the influence of small penalty parameters, are discretely idempotent; and (iv) the design of geometric multigrid methods for elliptic interface problems on implicitly defined meshes and their use as preconditioners for the conjugate gradient method. Also discussed is a variety of aspects relating to moving interfaces, including: (v) dG discretisations of the level set method on implicitly defined meshes; (vi) transferring state between evolving implicit meshes; (vii) preserving mesh topology to accurately compute temporal derivatives; (viii) high-order accurate reinitialisation of level set functions; and (ix) the integration of adaptive mesh refinement. In part two, several applications of the implicit mesh dG framework in two and three dimensions are presented, including examples of single phase flow in nontrivial geometry, surface tension-driven two phase flow with phase-dependent fluid density and viscosity, rigid body fluid–structure interaction, and free surface flow. A class of techniques known as interfacial gauge methods is adopted to solve the corresponding incompressible Navier–Stokes equations, which, compared to archetypical projection methods, have a weaker coupling between fluid velocity, pressure, and interface position, and allow high-order accurate numerical methods to be developed more easily. Convergence analyses conducted throughout the work demonstrate high-order accuracy in the maximum norm for all of the applications considered; for example, fourth-order spatial accuracy in fluid velocity, pressure, and interface location is demonstrated for surface tension-driven two phase flow in 2D and 3D. Specific application examples include: vortex shedding in nontrivial geometry, capillary wave dynamics revealing fine-scale flow features, falling rigid bodies tumbling in unsteady flow, and free surface flow over a submersed obstacle, as well as high Reynolds number soap bubble oscillation dynamics and vortex shedding induced by a type of Plateau–Rayleigh instability in water ripple free surface flow. In conclusion, these last two examples compare numerical results with experimental data and serve as an additional means of validation; they also reveal physical phenomena not visible in the experiments, highlight how small-scale interfacial features develop and affect macroscopic dynamics, and demonstrate the wide range of spatial scales often at play in interfacial fluid flow.

97 MATHEMATICS AND COMPUTING↗

genshell

GENSHELL is a three-dimensional shell mesh generation program. The threedimensional shell mesh is generated by mapping a two-dimensional quadrilateral mesh into three dimensions according to one of several types of transformations: translation, mapping onto a spherical, ellipsoidal, or cylindrical surface, and mapping onto a user-defined spline surface. The generated three-dimensional mesh can then be reoriented by offsetting, reflecting about an axis, revolving about an axis, and scaling the coordinates. GENSHELL can be used to mesh complex three-dimensional geometries composed of several sections when the sections can be defined in terms of transformations of two-dimensional geometries. The code GJOIN is then used to join the separate sections into a single body. GENSHELL updates the EXODUS quality assurance and information records to help track the codes and files used to generate the mesh. GENSHELL reads and writes two-dimensional and three-dimensional mesh databases in the GENESIS database format; there, it is compatible with the preprocessing, postprocessing, and analysis codes in the Sandia National Laboratories Engineering Analysis Code Access System (SEACAS).

Sjaardema, GregoryD.↗

Application of the INSTANT-HPS PN Transport Code to the C5G7 Benchmark Problem

INSTANT is the INL's next generation neutron transport solver to support high-fidelity multi-physics reactor simulation INSTANT is in continuous development to extend its capability Code is designed to take full advantage of middle to large cluster (10-1000 processors) Code is designed to focus on method adaptation while also mesh adaptation will be possible. It utilizes the most modern computing techniques to generate a neutronics tool of full-core transport calculations for reactor analysis and design. It can perform calculations on unstructured 2D/3D triangular, hexagonal and Cartesian geometries. Calculations can be easily extended to more geometries because of the independent mesh framework coded with the model Fortran. This code has a multigroup solver with thermal rebalance and Chebyshev acceleration. It employs second-order PN and Hybrid Finite Element method (PNHFEM) discretization scheme. Three different in-group solvers - preconditioned Conjugate Gradient (CG) method, preconditioned Generalized Minimal Residual Method (GMRES) and Red-Black iteration - have been implemented and parallelized with the spatial domain decomposition in the code. The input is managed with extensible markup language (XML) format. 3D variables including the flux distributions are outputted into VTK files, which can be visualized by tools such as VisIt and ParaView. An extension of the code named INSTANTHPS provides the capability to perform 3D heterogeneous transport calculations within fuel pins. C5G7 is an OECD/NEA benchmark problem created to test the ability of modern deterministic transport methods and codes to treat reactor core problems without spatial homogenization. This benchmark problem had been widely analyzed with various code packages. In this transaction, results of the applying the INSTANT-HPS code to the C5G7 problem are summarized.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Predictions of Transient Flame Lift-Off Length With Comparison to Single-Cylinder Optical Engine Experiments

A state-of-the-art, grid-convergent simulation methodology was applied to three-dimensional calculations of a single-cylinder optical engine. A mesh resolution study on a sector-based version of the engine geometry further verified the RANS-based cell size recommendations previously presented by Senecal et al. (“Grid Convergent Spray Models for Internal Combustion Engine CFD Simulations,” ASME Paper No. ICEF2012-92043). Convergence of cylinder pressure, flame lift-off length, and emissions was achieved for an adaptive mesh refinement cell size of 0.35 mm. Furthermore, full geometry simulations, using mesh settings derived from the grid convergence study, resulted in excellent agreement with measurements of cylinder pressure, heat release rate, and NOx emissions. On the other hand, the full geometry simulations indicated that the flame lift-off length is not converged at 0.35 mm for jets not aligned with the computational mesh. Further simulations suggested that the flame lift-off lengths for both the nonaligned and aligned jets appear to be converged at 0.175 mm. With this increased mesh resolution, both the trends and magnitudes in flame lift-off length were well predicted with the current simulation methodology. Good agreement between the overall predicted flame behavior and the available chemiluminescence measurements was also achieved. Our present study indicates that cell size requirements for accurate prediction of full geometry flame lift-off lengths may be stricter than those for global combustion behavior. This may be important when accurate soot predictions are required.

42 ENGINEERING↗

Using Tally Values to Add a Third Dimension when Viewing Planar Mesh Tallies - Paper 95

Mesh tallies show a calculated quantity, such as radiation flux or dose rate, in cells of a rectangular, cylindrical, or spherical mesh. Mesh tallies are useful when the spatial distribution of the quantity is of interest. They are usually displayed in two dimensional (2D) plots with the tally values represented by color coding. Geometry outlines and/or contour lines may be included. Three dimensional (3D) views of rectangular tallies often show a set of tally planes within the geometry. We describe here a new 3D mesh tally plot where the third dimension of a rectangular mesh tally plane is determined by the tally value in each mesh cell. We refer to such plots as elevated mesh tally plots. These plots may aid in analysis and presentation of the results of a transport calculation. The results shown here were calculated with the Monte Carlo transport code MCNPX2.7. The plots were made with the White Rock Science visualization and geometry editing program Moritz. The elevated mesh tally plots have been implemented within Moritz. The elevation method is, at present, only applicable to rectangular mesh tallies. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Cohesive phase-field chemo-mechanical simulations of inter- and trans- granular fractures in polycrystalline NMC cathodes via image-based 3D reconstruction

The optimal design and durable utilization of lithium-ion batteries necessitates an objective modeling approach to understand fracture and failure mechanisms. This paper presents a comprehensive chemo-mechanical modeling study focused on elucidating fracture-induced damage and degradation phenomena in the polycrystalline Li $\mathcal{x}$ Ni 0.5 Mn 0.3 Co 0.2 O 2 (NMC532) cathode. An innovative approach that utilizes image-based reconstructed 3D geometry as finite element (FE) mesh input is employed to enhance the precision in capturing the convoluted architecture and morphological features. For accurately representing the intricate crack configurations within the polycrystalline system, we adopted the cohesive phase-field fracture (CPF) model. Through the integration of advanced image-based geometry reconstruction technique and the promising CPF modeling approach, lithium (de)intercalation induced crack evolution (e.g., nucleation, propagation, branching and diverse modes including inter-/trans-(intra-) granular patterns) and the resulting chemical degradation can be precisely captured, which is also compared and validated with numerical predictions using a continuum damage model. In particular, this model predicts fracture induced degradation under varying fracture properties of grain boundaries and charging rates; the conclusion that NMC particles comprised of larger grains are predicted to have less degradation than those with smaller grains can also be drawn. This comprehensive analysis provides valuable insights into the fracture and degradation within polycrystalline NMC cathodes.

25 ENERGY STORAGE↗

Hydrocode simulations of a hypervelocity impact experiment over a range of velocities

This study investigates how the Eulerian hydrocode PAGOSA performs while simulating a hypervelocity impact experiment of stainless steel 304-L into aluminum 6061-T6. The specifications of the simulation were established in a paper detailing an experiment conducted at the Atomic Weapons Establishment (AWE) in the UK and the Centre d’Etudes de Gramet (CEG) in France. A variety of strength models and equations of state are employed under several different mesh sizes. The results display an excellent comparison with the experimental data and demonstrate dramatic differences in impacted crater geometries over various strength models and mesh sizes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-conformal interface-cohesive modeling with the shifted boundary method

The accurate simulation of boundary- and interface-dominated problems on complex geometries remains challenging when boundary- or interface-fitted meshes are difficult to generate, particularly for curved boundaries, polycrystalline microstructures, and dense interface networks. The Shifted Boundary Method (SBM) alleviates this meshing burden by shifting the enforcement of boundary conditions from the true boundary to a nearby surrogate boundary and recovering the effect of the true boundary through geometric correction terms, thereby enabling standard finite element spaces on non-boundary-fitted meshes. In this report, we develop a general shiftedboundary and shifted-interface framework within the open-source MOOSE framework. We first present a general SBM implementation for complex geometries on non-boundary-fitted meshes. We then adopt the Shifted Interface Method (SIM) for internal interfaces and develop a unified shifted-interface treatment in which the interface law is enforced on a surrogate interface and the effect of the true interface is recovered through shifted jumps, fluxes, and tractions. This perspective brings scalar thermal-contact and vector-valued cohesive-zone mechanics into a single framework, the latter realized as the Shifted Cohesive Zone Method (SCZM) and coupled with history-dependent constitutive models from NEML2. We further extend the MOOSE mesh infrastructure to support cohesive-zone calculations on distributed meshes. The framework is verified and demonstrated through three progressive studies: Poisson’s equation on a smoothed starshaped domain, a manufactured thermal-contact problem on a non-interface-fitted mesh, and a two-dimensional polycrystalline representative volume element combining crystal plasticity with cohesive grain-boundary interfaces. Across these studies, the shifted formulations reproduce boundary- and interface-fitted reference solutions with high fidelity, indicating that the proposed framework provides an accurate and efficient route to boundary- and interface-dominated simulations on arbitrary geometries without requiring fitted meshes.

Yang, Cheng-Hau↗

3D mesh regularization within an ALE code using a weighted line sweeping method

The Lagrangian formalism is widely used to simulate hydrodynamic responses in complex engineering applications, particularly those involving strong shock waves. However, as the mesh moves with the fluid, it can become highly distorted, requiring a regularization step. This involves constructing a new grid and remapping conservative quantities onto it to restore mesh quality. This work introduces a regularization method for block-structured meshes within a 3D ALE (Arbitrary Lagrangian-Eulerian) code. The proposed approach prevents mesh tangling while preserving the anisotropic features of the initial Lagrangian mesh. This regularization technique incorporates aspect ratio-based weights to control mesh smoothing. Unlike uniform rezoning techniques, this weighted approach maintains proximity to the Lagrangian mesh while improving mesh quality. Here, the method effectively handles concave geometries by mitigating the grid attraction phenomenon, which typically leads to mesh concentration along concave edges. Numerical experiments demonstrate its efficiency in regularizing severely deformed meshes, and its integration within the ALE framework is validated on challenging hydrodynamic test cases, including the triple point problem.

42 ENGINEERING↗