Mmg and ParMmg related publications
The Mmg plateform related publications are listed here:
- Tetrahedral remeshing in the context of large-scale numerical simulation and high performance computing G. Balarac, F. Basile, P. Bénard, F. Bordeu, J.-B. Chapelier, L. Cirrottola, G. Caumon, C. Dapogny, P. Frey, A. Froehly, G. Ghigliotti, R. Laraufie, G. Lartigue, C. Legentil, R. Mercier, V. Moureau, C. Nardoni, S. Pertant and M. Zakari, submitted, (2021).
In this article, we discuss several modern aspects of remeshing, which is the task of modifying an ill-shaped tetrahedral mesh with bad size elements so that it features an appropriate density of high-quality elements. After a brief sketch of classical stakes about meshes and local mesh operations, we notably expose (i) how the local size of the elements of a mesh can be adapted to a user-defined prescription (guided, e.g., by an error estimate attached to a numerical simulation), (ii) how a mesh can be deformed to efficiently track the motion of the underlying domain, (iii) how to construct a mesh of an implicitly-defined domain, and (iv) how remeshing procedures can be conducted in a parallel fashion when large-scale applications are targeted. These ideas are illustrated with several applications involving high-performance computing. In particular, we show how mesh adaptation and parallel remeshing strategies make it possible to achieve a high accuracy in large-scale simulations of complex flows, and how the aforementioned methods for meshing implicitly defined surfaces allow to represent faithfully intricate geophysical interfaces, and to account for the dramatic evolutions of shapes featured by shape optimization processes.
- Three-dimensional adaptive domain remeshing, implicit domain meshing, and applications to free and moving boundary problems C. Dapogny, C. Dobrzynski and P. Frey, JCP, 262, pp. 358–378 (2014). [cited by]
This paper is aimed at proposing a method for dealing with the problem of mesh deformation (or mesh evolution) in the context of free and moving boundary problems, in three space dimensions. The method consists in combining two different numerical parameterizations of domains: on the one hand, domains are equipped with a computational tetrahedral mesh, and on the other hand, they are represented as the negative subdomain of a `level set’ function. The core of the process consists in being able to go back and forth between those two descriptions, depending on their respective convenience with respect to the operations to be performed. Among other things, doing so implies to be able to get a computational mesh from an implicitly-defined domain. This in turns relies on an algorithm for handling three-dimensional domain remeshing (that is, remeshing at the same time both surface and volume parts of a given tetrahedral mesh). Applications are presented in the fields of mesh generation, shape optimization, and computational fluid dynamics.
- Anisotropic Delaunay mesh adaptation for unsteady simulations C.Dobrzynski, P.Frey, Proceedings of the 17th international Meshing Roundtable (2008).[cited by]
Anisotropic mesh adaptation is a key feature in many numerical simulations to capture the physical behavior of a complex phenomenon at a reasonable computational cost. It is a challenging problem, especially when dealing with time dependent and interface capturing or tracking problems. In this paper, we describe a local mesh adaptation method based on an extension of the Delaunay kernel for creating anisotropic mesh elements with respect to adequate metric tensors. In addition, we show that this approach can be successfully applied to deal with fluid-structure interaction problems where parts of the domain boundaries undergo large displacements.
The accuracy and efficiency of the method is assessed on various numerical examples of complex three-dimensional simulations.
- Parallel unstructured mesh adaptation using iterative remeshing and repartitioning. L.Cirrottola, A.Froehly, Research Report (2019).[cited by]
Mesh adaptation has proven to be a powerful tool for increasing the accuracy of numerical simulations whenever the solution exhibits strong non-uniform features over the computational domain. Sequential remeshing currently represents a bottleneck for parallel solvers. To this aim, we present a parallel remeshing algorithm that enables the reuse of existing sequential remeshing libraries, a non-intrusive linkage with third-party solvers, and an efficient exploitation of distributed parallel environments. The numerical procedure is implemented in the open source ParMmg software package.
They are citing us
We thank all the people that are citing the Mmg and ParMmg software in their papers: [software citations]!
Again, do not hesitate to contact us to share your results: we can add a post on this website!