Untangling of 2D meshes in ALE simulations

Authors:
Pavel Vachal;Rao V. Garimella;Mikhail J. Shashkov
Affiliations:
Czech Technical University in Prague, Brehová 7, 11519 Prague 1, Czech Republic;MS B284, T-7, Los Alamos National Laboratory, Los Alamos, NM;MS B284, T-7, Los Alamos National Laboratory, Los Alamos, NM
Venue:
Journal of Computational Physics
Year:
2004

Citing 6
Cited 4

Computational methods in Lagrangian and Eulerian hydrocodes

Computer Methods in Applied Mechanics and Engineering
Computational geometry in C

Computational geometry in C
An arbitrary Lagrangian-Eulerian computing method for all flow speeds

Journal of Computational Physics - Special issue: commenoration of the 30th anniversary
The construction of compatible hydrodynamics algorithms utilizing conservation of total energy

Journal of Computational Physics
Smoothing by optimisation for a quadrilateral mesh with invalid elements

Finite Elements in Analysis and Design
Reference Jacobian optimization-based rezone strategies for arbitrary Lagrangian Eulerian methods

Journal of Computational Physics

Invertible finite elements for robust simulation of large deformation

SCA '04 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation
Tetrahedral and hexahedral invertible finite elements

Graphical Models - Special issue on SCA 2004
Untangling triangulations through local explorations

Proceedings of the twenty-fourth annual symposium on Computational geometry
A two-dimensional unstructured cell-centered multi-material ALE scheme using VOF interface reconstruction

Journal of Computational Physics

Quantified Score

Hi-index	31.45

Visualization

Abstract

A procedure is presented to untangle unstructured 2D meshes containing inverted elements by node repositioning. The inverted elements may result from node movement in Arbitrary Lagrangian Eulerian (ALE) simulations of continuum mechanics problems with large shear deformation such as fluid flow and metal forming. Meshes with inverted elements may also be created due to the limitations of mesh generation algorithms particularly for nonsimplicial mesh generation. The untangling procedure uses a combination of direct node placement based on geometric computation of the feasible set, and node repositioning driven by numerical optimization of an objective function that achieves its minimum on a valid mesh. It is shown that a combination of the feasible set, based method and the optimization method achieves the best results in untangling complex 2D meshes. Preliminary results are also presented for untangling of 3D unstructured meshes by the same approach.