Paper: Robust and efficient validation of the linear hexahedral element

We present a method to compute the true validity of hexahedra in an efficient manner. More than 6 million hexahedra are analyzed on a single core per second.

Johnen, Amaury, Jean-Christophe Weil et Jean-François Remacle. « Robust and Efficient Validation of Linear Hexahedral Elements », dans 26th International Meshing Roundtable, Barcelona, Spain, 2017.

First paper: Combination of tetrahedra in hexahedra

We developed a method to very efficiently combine the elements of a tetrahedral mesh into hexahedra.  The new vertex based algorithm builds all the feasible potential hexahedra  under given quality constraints. Around 3 millions of potential hexahedra are generated in 10 seconds. A greedy combination is used to compute the final hex-dominant mesh.