An approach to achieving optimized complex sheet inflation under constraints

Sheet inflation is an enhanced and more general version of the classic pillowing procedure 1 used to modify hexahedral meshes. The flexibility of sheet inflation makes it a valuable tool for hex mesh generation, modification and topology optimization. However, it is still difficult to generate self-intersecting sheet within a local region while assuring the mesh quality. This paper proposes an approach to achieving optimized complex sheet inflation under various constraints. The approach can generate complex sheets that intersect themselves more than once and maximize the quality of the resultant mesh. We successfully apply this approach to mesh matching and mesh boundary optimizing. Graphical abstractDisplay Omitted HighlightsOur approach can inflate sheets under various constraints specified by user.Complex sheets that intersect themselves more than once can be locally inflated.The quality of the quad set can be improved by optimizing its chords.High node valences and edge valences can be reduced by sheet inflation.

[1]  Scott A. Mitchell,et al.  A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume , 1996, STACS.

[2]  Matthew L. Staten,et al.  Fun sheet matching: towards automatic block decomposition for hexahedral meshes , 2010, Engineering with Computers.

[3]  Kenji Shimada,et al.  Hexahedral Mesh Matching: Converting non‐conforming hexahedral‐to‐hexahedral interfaces into conforming interfaces , 2010 .

[4]  Steven E. Benzley,et al.  Hexahedral Sheet Extraction , 2002, IMR.

[5]  Timothy J. Tautges,et al.  Generation of multi-million element meshes for solid model-based geometries: The Dicer algorithm , 1997 .

[6]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[7]  Eloi Ruiz-Gironés,et al.  Unstructured and semi-structured hexahedral mesh generation methods , 2014 .

[8]  Jason F. Shepherd,et al.  Topological and geometrical properties of hexahedral meshes , 2009, Engineering with Computers.

[9]  Daniele Panozzo,et al.  Practical quad mesh simplification , 2010, Comput. Graph. Forum.

[10]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

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

[12]  Matthew L. Staten Sheet-based generation and modification of unstructured conforming all-hexahedral finite element meshes , 2010 .

[13]  Jason F. Shepherd,et al.  Topological modifications of hexahedral meshes via sheet operations: a theoretical study , 2009, Engineering with Computers.

[14]  Steven E. Benzley,et al.  The spatial twist continuum: a connectivity based method for representing all-hexahedral finite element meshes , 1997 .

[15]  Timothy J. Tautges,et al.  Topology Modification of Hexahedral Meshes Using Atomic Dual-based Operations , 2003, IMR.

[16]  Shuming Gao,et al.  An improved hexahedral mesh matching algorithm , 2015, Engineering with Computers.

[17]  Christopher R. Johnson,et al.  Topologic and Geometric Constraint-Based Hexahedral Mesh Generation , 2007 .

[18]  Timothy J. Tautges,et al.  Pillowing doublets: Refining a mesh to ensure that faces share at most one edge , 1995 .

[19]  Jason F. Shepherd,et al.  An interior surface generation method for all-hexahedral meshing , 2009, Engineering with Computers.

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Kenji Shimada,et al.  A close look at valences in hexahedral element meshes , 2010 .