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.
- The paper is available on arXiv: arxiv.org/abs/1705.02451.
- The C++ code will soon be available in Gmsh.
- Input tetrahedral meshes are available here.
