Complexity and modeling aspects of mesh refinement into quadrilaterals

Algorithmica (New York)

Volumn 26, Issue 1, 2000, Pages 148-171

  Mohring R H ^a   Muller Hannemann M ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Bidirected flows; Computer aided design; Mesh decomposition; Mesh generation; NP completeness

Indexed keywords

EID: 0012489005     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910008     Document Type: Article

References (27)

1. [A] R. P. Anstee, A polynomial algorithm for b-matching: an alternative approach, Information Processing Letters 24 (1987), 153-157.
2. [AMO] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. [B] J. R. Brauer, ed., What Every Engineer Should Know about Finite Element Analysis, Marcel Decker, New York, 1993.
4. [BE] M. Bern and D. Eppstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, 2nd edition (D.-Z. Du and F. Hwang, eds.), World Scientific, Singapore, 1995, pp. 47-123.
5. [BP] M. Bern and P. Plassmann, Mesh generation, in Handbook of Computational Geometry (J. Sack and J. Urrutia, eds.), Elsevier, Amsterdam, 1997, to appear.
6. +] S. E. Benzley, E. Perry, K. Merkley, B. Clark, and G. Sjaardama, A comparison of all hexagonal and all tetrahedral finite element meshes for elastic and elasto-plastic analysis, Proceedings of the 4th International Meshing Roundtable, Sandia National Laboratories, Albuquerque, NM, 1995, pp. 179-191.
7. [BS] T. D. Blacker and M. B. Stephenson, Paving: a new approach to automated quadrilateral mesh generation, International Journal for Numerical Methods in Engineering 32 (1991), 811-847.
8. [CK] A. O. Cifuentes and A. Kalberg, A performance study of tetrahedral and hexahedral elements in 3-D finite element structural analysis, Finite Elements in Analysis and Design 12 (1992), 313-318.
9. [D] U. Derigs, Programming in Networks and Graphs, Lecture Notes in Economics and Mathematical Systems, vol. 300, Springer-Verlag, Berlin, 1988.
10. [E] J. Edmonds, An Introduction to Matching, Lecture Notes, University of Michigan, Ann Arbor, MI, 1967.
11. [G] A. M. H. Gerards, Matching in Network Models (M. O. Ball et al., eds.), Handbooks in Operations Research and Management Science, vol. 7, North-Holland, Amsterdam, 1995, pp. 135-224.
12. [GJ] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
13. [H] K. Ho-Le, Finite element mesh generation methods: a review and classification, Computer-Aided Design 20 (1988), 27-38.
14. [J] B. Joe, Quadrilateral mesh generation in polygonal regions, Computer-Aided Design 27 (1995), 209-222.
15. [KS] S. Kannan and D. Soroker, Tiling polygons with parallelograms, Discrete & Computational Geometry 7 (1992), 175-188.
16. [LL] S. H. Lo and C. K. Lee, On using meshes of mixed element types in adaptive finite element analyses, Finite Elements in Analysis and Design 11 (1992), 307-336.
17. [M1] S. A. Mitchell, Choosing corners of rectangles for mapped meshing, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, ACM, New York, 1997, pp. 87-93.
18. [M2] M. Müller-Hannemann, High quality quadrilateral surface meshing without template restrictions: a new approach based on network flow techniques, Proceedings of the Sixth International Meshing Roundtable, Park City, UT, 1997, pp. 293-307.
19. [MMW] 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.
20. [MW1] M. Müller-Hannemann and K. Weihe, Minimum strictly convex quadrangulations of convex polygons, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, ACM, New York, 1997, pp. 193-202.
21. [MW2] M. Müller-Hannemann and K. Weihe, Improved approximations for minimum cardinality quadrangulations of finite element meshes, Technical Report No. 559/1997, Fachbereich Mathematik, Technische Universität Berlin, 1997, available via anonymous ftp from ftp.math.tu-berlin.de; cd pub/Preprints/combi; file Report-559-1991.ps.Z; an extended abstract appeared in Proceedings of the 5th Annual European Symposium on Algorithms, ESA 97, Graz, Austria, pages 364-377.
22. [MW2] M. Müller-Hannemann and K. Weihe, Improved approximations for minimum cardinality quadrangulations of finite element meshes, Technical Report No. 559/1997, Fachbereich Mathematik, Technische Universität Berlin, 1997, available via anonymous ftp from ftp.math.tu-berlin.de; cd pub/Preprints/combi; file Report-559-1991.ps.Z; an extended abstract appeared in Proceedings of the 5th Annual European Symposium on Algorithms, ESA 97, Graz, Austria, pages 364-377.
23. [TA] T. K. H. Tam and C. G. Armstrong, Finite element mesh control by integer programming, International Journal of Numerical Methods in Engineering 36 (1993), 2581-2605.
24. [W] V. I. Weingarten, The controversy of hex or tet meshing, Machine Design 1994, 74-77.
25. [WMBS] 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, NM, 1995, pp. 165-176.
26. [ZT] O. C. Zienkiewicz and R. L. Taylor, The Finite Element Method, McGraw Hill, London, 1989.
27. [ZZHW] J. Z. Zhu, O. C. Zienkiewicz, E. Hinton, and J. Wu, A new approach to the development of automatic quadrilateral mesh generation, International Journal of Numerical Methods in Engineering 32 (1991), 849-866.