Optimal Dual Schemes for Adaptive Grid Based Hexmeshing
Open Access
- 6 December 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 41 (2) , 1-14
Abstract
Hexahedral meshes are a ubiquitous domain for the numerical resolution of partial differential equations. Computing a pure hexahedral mesh from an adaptively refined grid is a prominent approach to automatic hexmeshing, and requires the ability to restore the all hex property around the hanging nodes that arise at the interface between cells having different size. The most advanced tools to accomplish this task are based on mesh dualization. These approaches use topological schemes to regularize the valence of inner vertices and edges, such that dualizing the grid yields a pure hexahedral mesh. In this article, we study in detail the dual approach, and propose four main contributions to it: (i) We enumerate all the possible transitions that dual methods must be able to handle, showing that prior schemes do not natively cover all of them; (ii) We show that schemes are internally asymmetric, therefore not only their construction is ambiguous, but different implementative choices lead to hexahedral meshes with different singular structure; (iii) We explore the combinatorial space of dual schemes, selecting the minimum set that covers all the possible configurations and also yields the simplest singular structure in the output hexmesh; (iv) We enlarge the class of adaptive grids that can be transformed into pure hexahedral meshes, relaxing one of the tight topological requirements imposed by previous approaches. Our extensive experiments show that our transition schemes consistently outperform prior art in terms of ability to converge to a valid solution, amount and distribution of singular mesh edges, and element count. Last but not least, we publicly release our code and reveal a conspicuous amount of technical details that were overlooked in previous literature, lowering an entry barrier that was hard to overcome for practitioners in the field.Keywords
All Related Versions
This publication has 34 references indexed in Scilit:
- All-hex meshing using singularity-restricted fieldACM Transactions on Graphics, 2012
- Dual loops meshingACM Transactions on Graphics, 2012
- Octree‐based reasonable‐quality hexahedral mesh generation using a new set of refinement templatesInternational Journal for Numerical Methods in Engineering, 2008
- Adaptive hexahedral mesh generation based on local domain curvature and thickness using a modified grid-based methodFinite Elements in Analysis and Design, 2007
- OCTREE-BASED HEXAHEDRAL MESH GENERATIONInternational Journal of Computational Geometry & Applications, 2000
- Automatic generation of hexahedral finite element meshesComputer Aided Geometric Design, 1995
- Two- and three-dimensional remeshing, mesh refinement and application to simulation of micromechanical processesComputational Materials Science, 1994
- Automatic three‐dimensional mesh generation by the finite octree techniqueInternational Journal for Numerical Methods in Engineering, 1991
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987
- Three-dimensional display of human organs from computed tomogramsComputer Graphics and Image Processing, 1979