Here is a list of softwares which I contributed to develop during my Ph.D. See also the page of Pascal Frey for other useful (and free !) tools.

mmg3d (version 5)

Discrete domain remeshing (C.D., Cécile Dobrzynski, Pascal Frey and Algiane Froehly).

mmg3d is a tetrahedral mesh modification tool developped by Cécile Dobrzynski and Pascal Frey, taking as an input a tetrahedral mesh {\mathcal T} , and modifying it into a well-shaped triangulation, with respect to an input metric tensor field when such is supplied. Till version 4, mmg3d has been working in both isotropic and anisotropic contexts, but did not allow to remesh the surface part of {\mathcal T} . This new version does not yet allow for anistropic remeshing, but allows to remesh at the same time the volumic part of {\mathcal T} and its surfacic part (or any surface discretized in {\mathcal T} ).

Remeshing of a ill-shaped mesh of a mechanical part (left : initial mesh and cut ; right : final result and corresponding cut)

Remeshing of a ill-shaped mesh of a statue (left : initial mesh and cut ; right : final result and corresponding cut)

mmgs

Discrete surface remeshing (C.D. and Pascal Frey).

mmgs is a tool for remeshing an arbitrary surface triangulation into a well-shaped, well-sampled surface mesh, closely approximating a guessed underlying continuous surface to the intial datum. This code uses ony local mesh operators (splits, collapses, swaps,...), and works for now in the context of isotropic surface remeshing. An extension to anisotropic surface remeshing is ongoing.

Remeshing of ill-shaped meshes (left : initial triangulations ; right : final result)

Advect

Numerical resolution of the linear transport equation on a simplicial computational mesh in 2d and 3d (Cuc Bui, C.D. and Pascal Frey).

This code takes as an input a computational triangular mesh {\mathcal T} , a velocity field V defined as a \mathbb{P}^1 function, a scalar \mathbb{P}^1 function \phi^0 over {\mathcal T} , and computes the solution of the transport equation of \phi^0 along V , for an arbitrary period of time, using the method of characteristics. This can be used for approximating the level set evolution equation.

Mshdist

Generation of the signed distance function to a discrete contour on a simplicial computational mesh in 2d and 3d (C.D. and Pascal Frey).

This code takes as an input a computational triangular mesh {\mathcal T} (e.g. a big box), and a discrete contour (a curve given as list of segments in 2d, or a surface mesh in 3d), and approximates the signed distance function to this contour at the nodes of {\mathcal T} . This can be used in the context of the level set method, when initializing the level set function (a mode of the code includes the very similar redistancing procedure).