An approach to achieving optimized complex sheet inflation under constraints

Mitchell SA, Tautges TJ. Pillowing doublets: refining a mesh to ensure that faces share at most one edge. In: 4th International Meshing Roundtable, 1995. Shepherd JF. Topologic and geometric constraint-based hexahedral mesh generation [PhD thesis], School of Computing, University of Utah; Salt Lake City, UT, USA; 2007. Shepherd, 2008, Hexahedral mesh generation constraints, Eng Comput, 24, 195, 10.1007/s00366-008-0091-4 Murdoch, 1997, The spatial twist continuum, Finite Elem Anal Des, 28, 137, 10.1016/S0168-874X(97)81956-7 Tautges, 2003, Topology modification of hexahedral meshes using atomic dual-based operations, IMR, 415 Ledoux, 2009, Topological modifications of hexahedral meshes via sheet operations, Eng Comput, 26, 433, 10.1007/s00366-009-0145-2 Ramos JS, Ruiz-Gironés E, Navarro XR. Unstructured and semi-structured hexahedral mesh generation methods; 2014. Melander DJ, Benzley S, Tautges T. Generation of multi-million element meshes for solid model-based geometries: the dicer algorithm. Tech. Rep.; Sandia National Labs., Albuquerque, NM (United States); 1997. Staten, 2009, Hexahedral mesh matching, Int J Numer Methods Eng, 1475 Borden MJ, Benzley SE, Shepherd JF. Hexahedral sheet extraction. In: IMR 2002, p. 147–52. Ledoux, 2009, Topological and geometrical properties of hexahedral meshes, Eng Comput, 26, 419, 10.1007/s00366-009-0144-3 Staten ML. Sheet-based generation and modification of unstructured conforming all-hexahedral finite element meshes. [PhD thesis], Carnegie Mellon University; 2010. Suzuki, 2010, An interior surface generation method for all-hexahedral meshing, Eng Comput, 26, 303, 10.1007/s00366-009-0159-9 Chen, 2015, An improved hexahedral mesh matching algorithm, Eng Comput Staten, 2010, A close look at valences in hexahedral element meshes, Int J Numer Methods Eng, 899 Lawler, 2001, 4.5. Combinatorial implications of max-flow min-cut theorem. 4.6. linear programming interpretation of max-flow min-cut theorem, Combin Optim Netw Matroids, 117 Hart, 1968, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans Syst Sci Cybern, 4, 100, 10.1109/TSSC.1968.300136 Dijkstra, 1959, A note on two problems in connection with graphs, Numer Math, 1, 269, 10.1007/BF01386390 Ford, 1956, Maximal flow through a network, Can J Math, 8, 399, 10.4153/CJM-1956-045-5 Mitchell, 1996, A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume, STACS, 96, 10.1007/3-540-60922-9_38 Kowalski, 2011, Fun sheet matching, Eng Comput Owen S. A survey of unstructured mesh generation technology. In: 7th international meshing roundtable; 1998. Tarini, 2010, Practical quad mesh simplification, Comput Graph Forum, 29, 407, 10.1111/j.1467-8659.2009.01610.x