All-hex meshing using singularity-restricted field

Yufei Li, Yang Liu, Weiwei Xu, Wenping Wang, Baining Guo
2012 ACM Transactions on Graphics  
a) Our method Jave = 0.936 Jmin = 0.609 (b) CubeCover Jave = 0.902 Jmin = 0.073 (c) Our method Jave = 0.947 Jmin = 0.658 (d) Volumetric PolyCube Jave = 0.950 Jmin = 0.131 Figure 1: High quality all-hex meshes generated by our method. Comparisons with CubeCover [Nieser et al. 2011] and volumetric PolyCube [Gregson et al. 2011] demonstrate that the hex meshes by our method are superior in mesh quality (the minimal scaled Jacobian of hexes is shown in the figure, bigger is better) and singularity
more » ... r) and singularity placement (see the zoom-in views for comparison). Abstract Decomposing a volume into high-quality hexahedral cells is a challenging task in geometric modeling and computational geometry. Inspired by the use of cross field in quad meshing and the CubeCover approach in hex meshing, we present a complete all-hex meshing framework based on singularity-restricted field that is essential to induce a valid all-hex structure. Given a volume represented by a tetrahedral mesh, we first compute a boundary-aligned 3D frame field inside it, then convert the frame field to be singularity-restricted by our effective topological operations. In our all-hex meshing framework, we apply the CubeCover method to achieve the volume parametrization. For reducing degenerate elements appearing in the volume parametrization, we also propose novel tetrahedral split operations to preprocess singularity-restricted frame fields. Experimental results show that our algorithm generates high-quality all-hex meshes from a variety of 3D volumes robustly and efficiently.
doi:10.1145/2366145.2366196 fatcat:x5xbiutonneoncbvqmdz2zjhku