Singularity-constrained octahedral fields for hexahedral meshing

Despite high practical demand, algorithmic hexahedral meshing with guarantees on robustness and quality remains unsolved. A promising direction follows the idea of integer-grid maps, which pull back the Cartesian hexahedral grid formed by integer isoplanes from a parametric domain to a surface-conforming hexahedral mesh of the input object. Since directly optimizing for a high-quality integer-grid map is mathematically challenging, the construction is usually split into two steps: (1) generation of a surface-aligned octahedral field and (2) generation of an integer-grid map that best aligns to the octahedral field. The main robustness issue stems from the fact that smooth octahedral fields frequently exhibit singularity graphs that are not appropriate for hexahedral meshing and induce heavily degenerate integer-grid maps. The first contribution of this work is an enumeration of all local configurations that exist in hex meshes with bounded edge valence, and a generalization of the Hopf-Poincaré formula to octahedral fields, leading to necessary local and global conditions for the hex-meshability of an octahedral field in terms of its singularity graph. The second contribution is a novel algorithm to generate octahedral fields with prescribed hex-meshable singularity graphs, which requires the solution of a large nonlinear mixed-integer algebraic system. This algorithm is an important step toward robust automatic hexahedral meshing since it enables the generation of a hex-meshable octahedral field.

[1]  Loïc Maréchal,et al.  Advances in Octree-Based All-Hexahedral Mesh Generation: Handling Sharp Features , 2009, IMR.

[2]  Zhigang Deng,et al.  Hexahedral mesh re-parameterization from aligned base-complex , 2015, ACM Trans. Graph..

[3]  David Bommes,et al.  HexEx: robust hexahedral mesh extraction , 2016, ACM Trans. Graph..

[4]  Hujun Bao,et al.  Boundary aligned smooth 3D cross-frame field , 2011, ACM Trans. Graph..

[5]  S. L. Hakimi,et al.  On Planar Graphical Degree Sequences , 1977 .

[6]  Bruno Lévy,et al.  Quad‐Mesh Generation and Processing: A Survey , 2013, Comput. Graph. Forum.

[7]  Shuming Gao,et al.  Frame Field Guided Topological Improvement for Hex Mesh Using Sheet Operations , 2016 .

[8]  Keenan Crane,et al.  Globally optimal direction fields , 2013, ACM Trans. Graph..

[9]  David Bommes,et al.  Quantized global parametrization , 2015, ACM Trans. Graph..

[10]  Franck Ledoux,et al.  23rd International Meshing Roundtable (IMR23) Block-Structured Hexahedral Meshes for CAD Models using 3D Frame Fields , 2014 .

[11]  S. Fisk,et al.  Generations of triangulations of the sphere , 1967 .

[12]  Jason F. Shepherd,et al.  Methods and Applications of Generalized Sheet Insertion for Hexahedral Meshing , 2007, IMR.

[13]  Zhigang Deng,et al.  Robust structure simplification for hex re-meshing , 2017, ACM Trans. Graph..

[14]  Wenzel Jakob,et al.  Robust hex-dominant mesh generation using field-guided polyhedral agglomeration , 2017, ACM Trans. Graph..

[15]  David Bommes,et al.  Boundary element octahedral fields in volumes , 2017, TOGS.

[16]  Hujun Bao,et al.  Frame Field Singularity Correctionfor Automatic Hexahedralization , 2014, IEEE Transactions on Visualization and Computer Graphics.

[17]  Franck Ledoux,et al.  Smoothness driven frame field generation for hexahedral meshing , 2016, Comput. Aided Des..

[18]  Eugene Zhang,et al.  All‐Hex Mesh Generation via Volumetric PolyCube Deformation , 2011, Comput. Graph. Forum.

[19]  Pierre Alliez,et al.  Integer-grid maps for reliable quad meshing , 2013, ACM Trans. Graph..

[20]  Franck Ledoux,et al.  Analysis of Non-Meshable Automatically Generated Frame fields. , 2016 .

[21]  Christophe Geuzaine,et al.  A frontal approach to hex-dominant mesh generation , 2014, Adv. Model. Simul. Eng. Sci..

[22]  Alla Sheffer,et al.  Practical hex-mesh optimization via edge-cone rectification , 2015, ACM Trans. Graph..

[23]  Hujun Bao,et al.  ℓ1-Based Construction of Polycube Maps from Complex Shapes , 2014, ACM Trans. Graph..

[24]  Hujun Bao,et al.  All-hex meshing using closed-form induced polycube , 2016, ACM Trans. Graph..

[25]  Marcel Campen,et al.  Similarity maps and field-guided T-splines , 2017, ACM Trans. Graph..

[26]  R. Ho Algebraic Topology , 2022 .

[27]  Paolo Cignoni,et al.  PolyCube-Maps , 2004, SIGGRAPH 2004.

[28]  Eugene Zhang,et al.  Tensor field design in volumes , 2017, SIGGRAPH Asia Technical Briefs.

[29]  Konrad Polthier,et al.  CUBECOVER – Parameterization of 3D Volumes , 2011 .

[30]  David Bommes,et al.  Advanced Automatic Hexahedral Mesh Generation from Surface Quad Meshes , 2013, IMR.

[31]  P.-E. Bernard,et al.  Frame field smoothness-based approach for hex-dominant meshing , 2016, Comput. Aided Des..

[32]  Konrad Polthier,et al.  QuadCover ‐ Surface Parameterization using Branched Coverings , 2007, Comput. Graph. Forum.

[33]  Jason F. Shepherd,et al.  Hexahedral mesh generation constraints , 2008, Engineering with Computers.

[34]  Dmitry Sokolov,et al.  Fixing normal constraints for generation of polycubes , 2015 .

[35]  David Bommes,et al.  QEx: robust quad mesh extraction , 2013, ACM Trans. Graph..

[36]  LiuHeng,et al.  Singularity-constrained octahedral fields for hexahedral meshing , 2018 .

[37]  Kang Zhang,et al.  Recent algorithms on automatic hexahedral mesh generation , 2015, 2015 10th International Conference on Computer Science & Education (ICCSE).

[38]  Bruno Lévy,et al.  N-symmetry direction field design , 2008, TOGS.

[39]  Jeff Erickson,et al.  Efficiently Hex-Meshing Things with Topology , 2013, SoCG '13.

[40]  David Bommes,et al.  Mixed-integer quadrangulation , 2009, SIGGRAPH '09.

[41]  Christopher M. Tierney,et al.  Common Themes in Multi-block Structured Quad/Hex Mesh Generation , 2015 .

[42]  Bruno Lévy,et al.  Practical 3D frame field generation , 2016, ACM Trans. Graph..

[43]  Daniele Panozzo,et al.  Directional Field Synthesis, Design, and Processing , 2016, Comput. Graph. Forum.

[44]  Elaine Cohen,et al.  Mixed-element volume completion from NURBS surfaces , 2012, Comput. Graph..

[45]  Tamal K. Dey,et al.  Computing homology groups of simplicial complexes in R3 , 1998, JACM.

[46]  Baining Guo,et al.  All-hex meshing using singularity-restricted field , 2012, ACM Trans. Graph..

[47]  Keenan Crane,et al.  Trivial Connections on Discrete Surfaces , 2010, Comput. Graph. Forum.

[48]  Yang Liu,et al.  Efficient Volumetric PolyCube‐Map Construction , 2016, Comput. Graph. Forum.