International audienceThe aim of this paper is to propose 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 subdomains of 'level set' functions. We then consistently switch from one description to the other, 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 considered in the fields of mesh generation, shape optimization, and computational fluid dynamics
Summary. 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. Here, we describe an extension of the Delaunay kernel for creating anisotropic mesh elements based on adequate metric tensors. The accuracy and efficiency of the method is assessed on various numerical examples of complex three-dimensional simulations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.