Shelling hexahedral complexes for mesh generation

Journal of Graph Algorithms and Applications

Volumn 5, Issue 5, 2001, Pages 59-91

  Müller Hannemann, Matthias ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FINITE ELEMENT METHOD; GRAPH THEORY; ITERATIVE METHODS;

COMBINATORIAL METHOD; COMPUTER-AIDED DESIGN; CYCLE STRUCTURES; FINITE ELEMENT MESHES; GRAPH TRANSFORMATION; NEW APPROACHES; SIMPLE++; SOLID BODIES; SUBDOMAIN; SURFACE MESH;

MESH GENERATION;

EID: 0042782694     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00040     Document Type: Conference Paper

References (42)

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph drawing: Algorithms for the visualization of graphs, Prentice Hall, 1999.
2. M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Computing in Euclidean Geometry, 2nd Edition (D.-Z. Du and F. Hwang, eds.), World Scientific, Singapore, 1995, pp. 47-123.
3. M. Bern and P. Plassmann, Mesh generation, chapter 6 of Handbook of Computational Geometry (J. Sack and J. Urrutia, eds.), North-Holland, Elsevier Science, 2000, pp. 291-332.
4. T. D. Blacker and R. J. Meyers, Seams and wedges in plastering: A 3D hexahedral mesh generation algorithm, Engineering with Computers 9 (1993), 83-93.
5. T. D. Blacker and M. B. Stephenson, Paving: A new approach to automated quadrilateral mesh generation, Int. J. Numer. Methods in Eng. 32 (1991), 811-847.
6. N. A. Calvo and S. R. Idelsohn, All-hexahedral element meshing by generating the dual mesh, Computational Mechanics: New Trends and Applications (S. Idelsohn, E. Oñate, and E. Dvorkin, eds.), CIMNE, Barcelona, Spain, 1998.
7. S. A. Canann, Plastering: A new approach to automated, 3d hexahedral mesh generation, Am. Inst. Aeronautics and Astronautics, Reston, VA (1992).
8. W. A. Cook and W. R. Oakes, Mapping methods for generating three-dimensional meshes, Computers in Mechanical Engineering, CIME Research Supplement (1982), 67-72.
9. G. Danaraj and V. Klee, A representation of 2-dimensional pseudomanifolds and its use in the design of a linear-time shelling algorithm, Annals of Discrete Mathematics 2 (1978), 53-63.
10. D. Eppstein, Linear complexity hexahedral mesh generation, Computational Geometry - Theory and Applications 12 (1999), 3-16.
11. N. T. Folwell and S. A. Mitchell, Reliable whisker weaving via curve contraction, Engineering with Computers 15 (1999), 292-302.
12. L. A. Freitag and P. M. Knupp, Tetrahedral element shape optimization via the jacobian determinant and condition number, Proceedings of the 8th International Meshing Roundtable, South Lake Tahoe, CA, Sandia National Laboratories, Albuquerque, USA, 1999, pp. 247-258.
13. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. of Computing 2 (1973), 135-158.
14. P. M. Knupp, Matrix norms & the condition number: A general framework to improve mesh quality via node-movement, Proceedings of the 8th International Meshing Roundtable, South Lake Tahoe, CA, Sandia National Laboratories, Albuquerque, USA, 1999, pp. 13-22.
15. P. M. Knupp, Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities, part II - a framework for volume mesh optimization, Int. J. Numer. Methods in Eng. 48 (2000), 1165-1185.
16. T. S. Li, R. M. McKeag, and C.G. Armstrong, Hexahedral meshing using midpoint subdivision and integer programming, Computer Methods in Applied Mechanics and Engineering 124 (1995), 171-193.
17. W. Min, Generating hexahedron-dominant mesh based on shrinking-mapping method, Proceedings of the 6th International Meshing Roundtable, Park City, Utah, Sandia National Laboratories, Albuquerque, USA, 1997, pp. 171-182.
18. S. A. Mitchell, A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume, Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), Lecture Notes in Computer Science 1046, Springer, 1996, pp. 465-476.
19. R. H. Möhring and M. Müller-Hannemann, Complexity and modeling aspects of mesh refinement into quadrilaterals, Algorithmica 26 (2000), 148-171.
20. R. H. Möhring, M. Müller-Hannemann, and K. Weihe, Mesh refinement via bidirected flows: Modeling, complexity, and computational results, Journal of the ACM 44 (1997), 395-426.
21. M. Müller-Hannemann, Hexahedral mesh generation by successive dual cycle elimination, Engineering with Computers 15 (1999), 269-279.
22. M. Müller-Hannemann, High quality quadrilateral surface meshing without template restrictions: A new approach based on network flow techniques, International Journal of Computational Geometry & Applications 10 (2000), 285-307.
23. P. Murdoch, The spatial twist continuum: A dual representation of the all hexahedral finite element mesh, Ph.D. thesis, Mechanical Engineering, Brigham Young University, Utah, 1995.
24. P. Murdoch, S. E. Benzley, T. D. Blacker, and S. A. Mitchell, The spatial twist continuum: a connectivity based method for representing and constructing all-hexahedral finite element meshes, Finite Elements in Analysis and Design 28 (1997), 137-149.
25. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, vol. 32, North-Holland, 1988.
26. S. Owen, Meshing research corner, http://www.andrew.cmu.edu/user/sowen/ mesh.html.
27. M. A. Price and C. G. Armstrong, Hexahedral mesh generation by medial surface subdivision: Part II, solids with flat and concave edges, Int. J. Numer. Methods in Eng. 40 (1997), 111-136.
28. M. A. Price, C. G. Armstrong, and M. A. Sabin, Hexahedral mesh generation by medial surface subdivision: Part I, solids with convex edges, Int. J. Numer. Methods in Eng. 38 (1995), 3335-3359.
29. R. Schneiders, Information on finite element mesh generation, available online at http://www-users.informatik.rwthaachen.de/~roberts/meshgeneration. html.
30. R. Schneiders, Open problem, available online at http://www-users. informatik.rwth-aachen.de/~roberts/open.html, 1995.
31. R. Schneiders, A grid-based algorithm for the generation of hexahedral element meshes, Engineering with Computers 12 (1996), 168-177.
32. R. Schneiders, R. Schindler, and F. Weiler, Octree-based generation of hexahedral element meshes, Proceedings of the 5th International Meshing Roundtable, Sandia National Laboratories, Albuquerque, USA, 1996, pp. 205-215.
33. G. C. Shephard, Combinatorial properties of associated zonotopes, Canadian Journal of Mathematics 26 (1974), 302-321.
34. T. J. Tautges, T. Blacker, and S. A. Mitchell, The whisker weaving algorithm: A connectivity-based method for constructing all-hexahedral finite element meshes, Int. J. Numer. Methods in Eng. 39 (1996), 3327-3349.
35. T. J. Tautges and S. A. Mitchell, Whisker weaving: Invalid connectivity resolution and primal construction algorithm, Proceedings of the 4th International Meshing Roundtable, Sandia National Laboratories, Albuquerque, USA, 1995, pp. 115-127.
36. W. Thurston, Hexahedral decomposition of polyhedra, Posting to sci.math., 25 Oct., 1993, available online at http://www.ics.uci.edu/~eppstein/gina/ Thurston-hexahedra.html.
37. P. M. Tuchinsky and B. W. Clark, The "HexTet" hex-dominant automesher: An interim progress report, Proceedings of the 6th International Meshing Roundtable, Park City, Utah, Sandia National Laboratories, Albuquerque, USA, 1997, pp. 183-193.
38. W. T. Tutte, Convex representations of graphs, Proceedings London Mathematical Society 10 (1960), 304-320.
39. W. T. Tutte, How to draw a graph, Proceedings London Mathematical Society 13 (1963), 743-768.
40. D. R. White, L. Mingwu, S. E. Benzley, and G. D. Sjaardema, Automated hexahedral mesh generation by virtual decomposition, Proceedings of the 4th International Meshing Roundtable, Sandia National Laboratories, Albuquerque, USA, 1995, pp. 165-176.
41. G. M. Ziegler, Lectures on polytopes, revised ed., Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York, 1998.
42. G. M. Ziegler, Shelling polyhedral 3-balls and 4-polytopes, Discrete & Computational Geometry 19 (1998), 159-174.