JeanFrançois Remacle Professor Contact Recent publications
After his Engineering Degree at the University of Liège in Belgium in 1992, JeanFrançois Remacle obtained in 1997 a Ph.D. from the same University. He then spent two years at the Ecole Polytechnique de Montréal as a postdoctoral fellow of Prof. F. Trochu, followed by three years at Rensselaer Polytechnic Institute in the research team of Prof. M. Shephard (one year as research associate followed by two years as research assistant professor).
It was during his stay at Rensselaer that Pr. Remacle started to work closely with Mark Shephard on mesh generation. Pr. Shephard's seminal work on mesh generation is one of the most important contributions ever. It was also during that stay that Pr. Remacle started the development of Gmsh, the open source mesh generator.
After these five years in Northern America, JeanFrançois Remacle joined the Université catholique de Louvain in 2002 as an assistant Professor. He then became Associate Professor in 2005 and Full Professor in 2012. In the following years of his return to Europe, Pr. Remacle dedicated a large part of his research to mesh generation.
IMMC main research direction(s): Computational science
Keywords: finite elements mesh generation
Research group(s): MEMA
PhD and Postdoc researchers under my supervision:
Automatic hexahedral mesh generation for boundary layers Christos Georgiadis
The main objective of our work is to provide with a fast and reliable method for generating boundary layer meshes. We follow a strategy that uses direction fields and a frontal point insertion strategy. The input of our algorithm is an initial triangular mesh of our domain and a direction field calculated on it. The goal is to compute the vertices of the final mesh by an advancing front strategy along the direction field. The final mesh will consists of right angle triangles, optimal for merging into quadrilaterals.

PierreAlexandre Beaufort
The aim of the 'ARC WAVES project 15/1903' was to perform seismic migration from nonstandard geometries, i.e. geometries that are not defined properly; typically, computer aideddesign (CAD) is not available.
My thesis was one part of this project: enabling mesh generation on those nonstandard geometries.
The challenge is to deal with a class of geometries which is a nightmare for numerical computations.
Information has to be recovered in order to produce high quality mesh, such as full quadrangles (2D) and dominant hexahedra (3D).
Surface parameterization enables mesh generation, while crossfields and 3D frames guide quadrangulations and hexahedrizations (respectively).
Further details on https://www.hextreme.eu/ 
Multithreaded Mesh Generation Célestin Marot
The main goal of this thesis is to speedup tetrahedral mesh generation by an order of magnitude. To do so, we are parallelizing and enhancing the whole mesh generation process. Promising results are uncovered at
https://www.hextreme.eu/

Curvilinear mesh adaptation Amaury Johnen
graduated as a physician engineer at the University of Liège (Belgium) in 2011. Then he accomplished a PhD in the topic of quadrangular mesh generation and cuvilinear mesh validation, under the supervision of professor Christophe Geuzaine. He started a postdoctoral research in January 2016 under the supervision of professor JeanFrançois Remacle for working on curvilinear mesh generation, hexdominant mesh generation and mesh validation. 
Allhexahedral meshing Kilian Verhetsel
While there exist algorithms to generate hexdominant meshes, which contain a majority of hexahedra as well as a mixture of tetrahedra, prisms, and pyramids, automatically generating hexahedral meshes with elements of a reasonable quality is not currently possible. Subdividing the elements of a hexdominant mesh could allow hexahedral meshes to be generated automatically, but the best known subdivision of a pyramid requires too many elements to be practical (see figure).
My work focuses on finding allhexahedral meshes of small models such as this pyramid by first finding a topological solution using combinatorial search techniques. A geometric mesh will then be produced by finding coordinates for each vertex in the mesh. 
Hextreme François Henrotte
completed his Engineering Degree in 1991 and his PhD in 2000, both at the University of Liège in Belgium. He then spent 4 years at the Katholieke Universiteit Leuven and 6 years at the Institut für Elektrische Maschinen in Aachen, Germany, and is now with the UCL and the ULiège. Developer in the opensource packages Gmsh, GetDP and Onelab, he has also developed skills in the multiphysics simulation of electrical machines and drives. His main interests are finite element analysis, numerical modeling, electromechanical coupling, material properties (hysteresis, iron losses, superconductors), applied mathematics (differential geometry, algebraic topology, convex analysis, dual analysis, energy methods), multiscale methods, sensitivity and optimization.

Polycube decomposition of 3D volumes Jovana Jezdimirovic
The aim of the research thesis is to push forward the stateoftheart of mesh generation and propose for the first time a methodology that allows to automatically create structured multiblock meshes for general 3D domains. For that, an innovative approach that enables automatic decomposition of a general 3D domain into “polycubes” is proposed. A “polycube” map is a mechanism that allows a seamless parameterization of a 3D domain. The “polycube” decomposition provides the multiblock structure that is needed for structured meshing. In order to achieve this goal, the first part of the thesis is dedicated to the development of a “polyquad” decomposition of a general 2D surface. It is relied on solving adequate Ginzburg Landau equations in order to develop a robust procedure that generates cross fields and locates critical points. Existence and location of critical points – represented as elliptic Fekete points are proved in recent results by Jezdimirovic, 2017. Further, critical points will be connected through the integral lines leading to an automatic decomposition of the domain into “quadrilaterals”. In the next step, the presented idea will be extended to 3D in order to create automatic algorithm for the “polycube” decomposition of 3D volumes. 
Fast Helmholtz Solvers on MultiThreaded Architectures Ruiyang Dai
The Helmholtz equation arises in the study of various physical problems involving the propagation of waves, like electromagnetic radiation, seismology or acoustics. The goal of the project is to develop a Helmholtz solver that can accelerate high frequency computations by at least one order of magnitude with respect to stateofthe art approaches. We propose to combine the following three ingredients to achieve a breakthrough in the solution of highfrequency Helmholtz problems:
1. Use a spectral finite element discretization on fully hexahedral meshes, both cartesian and non structured, for which AILUtype preconditioners can be efficiently applied on each subdomain of the geometry.
2. Develop a quasioptimal DDM with a parallel sweepingtype preconditioner to allow for optimal convergence between the subdomains.
3. Implement the solver using a common kernel language to make the solver run on different devices (both GPU and CPU) using different thread programming interfaces (CUDA, OpenCL, and OpenMP). 
3D crossfield generation for multibloc decomposition Alexandre Chemin
The aim of the project is to realize multibloc decomposition of 3D volumes in order to generate full hex meshes. Nowadays, this kind of decomposition is done by hand. The purpose of this work is to be able to do it in an automatic way. In order to reach this objective, we are generating 3D crossfields in this volume to locate singular points and automatize the decomposition. 
Automatic quadrilateral and hexahedral meshing Maxence Reberol
My research interests are automatic block decomposition, quadrilateral meshing, hexahedral meshing and robust hexdominant meshing. 
GinzburgLandau and cross fields Alexis Macq
Minimizers of socalled GinzburgLandau functionals are functions that minimize both their variations and the passage of their norms to values different from 1. The arbitration between the importance of these two elements is done via a parameter epsilon. When epsilon is set to 0, the norm of the minimizers is 1 unless, if necessary, in a finite number of points. The presence of those points (called singular points) depends on the surface considered. The study of GinzburgLandau functionals is fashionable. In the context of mesh applications, these functionals are notably used for the construction of the most regular possible cross fields intended to be supports for the construction of quadrangular meshes as regular as possible. In this context, the singular points of minimizers of GinzburgLandau functionals can be mapped to singular nodes in the meshes we are trying to construct. Indeed, these meshes pursue the same two objectives as those involved in the GinzburgLandau functionals, namely, be as regular as possible and placing singular nodes in an optimized manner if singular nodes are necessary. In the case of nonconstant curvature surfaces, the introduction of a covariant gradient can potentially make it possible to construct GinzburgLaudau functionals that are more suitable for these surfaces.
Study of a GinzburgLandau fonctional containing a covariant gradient.
Implementation of mathematical curvature for numerical applications.
Mathematical study of cross fields. 
A preexascale Vortex Particlemesh solver for complex FluidStructure Interaction problems. Pierre Balty
We present an accurate and highly scalable vortex particle method builds upon a MultiResolution discretization (MR), an Immersed Interface Method (IIM) and efficient elliptic solvers to simulate bioinspired locomotion in 3D. This project is intended to bring all the mentioned approaches together to the next scale of computational intensity and concurrency. The consistency between our Lagrangian formulation, these advanced numerical frameworks and a HPCoriented implementation should unlock the full potential of Belgium’s next generation HPC architectures and thus, enable a leap in the scale of computable problems. 
Threedimensional multiblock decomposition for automatic hexahedral mesh generation and application to fluid flow simulations. Mattéo Couplet
In computational physics, the vast majority of Partial Differential Equation (PDE) solvers rely on a spatial discretization of the bulk of the domain, typically a mesh. Thus far, geometrically complex domains are discretized predominantly using unstructured meshes, on which the PDE is subsequently solved using the Finite Element Method. Methods based on unstructured meshes are however inherently penalized in their computational efficiency. On the contrary, the regularity of block structured meshes can be leveraged to build efficient algorithms. For this reason, automatic generation of blockstructured meshes is the holy grail of mesh generation.
A first objective of the research project is therefore to explore new approaches for generating multiblock decompositions of general 3D domains. We will build on the recent developments in 3D frame fields and aim at improving formulations based on the constrained minimization of an energy function. A second lead that will be explored is based on the decomposition of the domain in convex subregions, on which existing methods are more robust.
Constructing a new class of meshes is only relevant if those meshes are endowed with a true benefit in terms of CPU/GPU time and accuracy. A second objective is therefore to extend existing Computational Fluid
Dynamics technologies for Cartesian grids to multiblock grids. In particular, we want to take advantage of the conformal maplike nature of the mesh to increase computational performance, and also show how our methodology can be applied to models with moving or deforming boundaries. 
