AlgoHex SIGNED

Project "AlgoHex" data sheet

The following table provides information about the project.

 Partnership

Take a look of project's partnership.

Map

 Project objective

'Digital geometry representations are nowadays a fundamental ingredient of many applications, as for instance CAD/CAM, fabrication, shape optimization, bio-medical engineering and numerical simulation. Among volumetric discretizations, the 'holy grail' are hexahedral meshes, i.e. a decomposition of the domain into conforming cube-like elements. For simulations they offer accuracy and efficiency that cannot be obtained with alternatives like tetrahedral meshes, specifically when dealing with higher-order PDEs. So far, automatic hexahedral meshing of general volumetric domains is a long-standing, notoriously difficult and open problem. Our main goal is to develop algorithms for automatic hexahedral meshing of general volumetric domains that are (i) robust, (ii) scalable and (iii) offer precise control on regularity, approximation error and element sizing/anisotropy. Our approach is designed to replicate the success story of recent integer-grid map based algorithms for 2D quadrilateral meshing. The underlying methodology offers the essential global view on the problem that was lacking in previous attempts. Preliminary results of integer-grid map hexahedral meshing are promising and a breakthrough is in reach. We identified five challenges that need to be addressed in order to reach practically sufficient hexahedral mesh generation. These challenges have partly been resolved in 2D, however, the solutions do not generalize to 3D due to the increased mathematical complexity of 3D manifolds. Nevertheless, with our experience in developing and evaluating the 2D techniques, we identified the key properties that are necessary for success and accordingly propose novel volumetric counterparts that will be developed in the AlgoHex project.'