All-Hex Meshing of Multiple-Region Domains without Cleanup

Area of Science:

• Computational geometry
• Computer-aided engineering
• Numerical simulation

Background:

• Generating high-quality all-hex meshes is crucial for accurate finite element analysis.
• Existing methods often require significant post-processing cleanup, increasing complexity and time.
• Handling multi-region domains and complex topologies remains a challenge.

Purpose of the Study:

• To present a novel algorithm for automated all-hex meshing of multi-region domains.
• To develop a robust and cleanup-free meshing technique.
• To improve the predictability and efficiency of hex-mesh generation.

Main Methods:

• The algorithm utilizes a strongly balanced octree as a starting point.
• Grid points are slightly offset from geometric boundaries, avoiding direct snapping.
• The offset grid is intersected with the geometry to generate the mesh.
• The method avoids flat angles and handles complex topologies effectively.

Main Results:

• The algorithm successfully generates all-hex meshes without requiring post-processing cleanup.
• It demonstrates robustness in handling multi-region domains and complex geometries.
• The technique avoids common meshing issues like flat angles, pillowing, and swapping.

Conclusions:

• The presented algorithm offers a predictable and efficient solution for all-hex meshing.
• It overcomes limitations of prior methods in handling complex domains and topologies.
• The cleanup-free nature significantly reduces computational effort and improves workflow.