Outline of the algorithm
This page describes the main steps of the ParMmg algorithm.
Centralized meshes are colored and distributed among available processors.
On each processor, the mesh is subdivided into sub-meshes of size optimal for the sequential remesher.
The sequential remesher is called on each sub-mesh whose interfaces have been freezed.
In order to be able to remesh the constrained interfaces, we create new sub-meshes using a front migration algorithm: now, the old freezed interfaces must be inside the sub-meshes.
If the mesh is not "perfect" goto 3. else goto 6.