Improved approximations for minimum cardinality quadrangulations of finite element meshes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 364-377

  Müller Hannemann, Matthias ^a   Weihe, Karsten ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER AIDED DESIGN; CONFORMAL MAPPING; FINITE ELEMENT METHOD; GRAPH THEORY; MESH GENERATION;

ASYMPTOTIC COMPLEXITY; CRASH SIMULATION; FINITE ELEMENT MESHES; LINEAR-TIME ALGORITHMS; PERFORMANCE GUARANTEES; PLANAR SEPARATOR THEOREM; PRE-PROCESSING STEP; TORSION PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 21744448103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_28     Document Type: Conference Paper

References (19)

1. F. Barahona. Planar multicommodity flows, max cut and the Chinese postman problem. In W. Cook and P. D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1, pages 189-202. American Mathematical Society, Providence, RI, 1990.
2. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, 2nd Edition, pages 47-123. World Scientific, Singapore, 1995.
3. U. Derigs. Programming in networks and graphs: on the combinatorial background and near-equivalence of network flow and matching algorithms. Springer, 1988.
4. J. Edmonds and E.L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5:88-124, 1973.
5. H. Everett, W. Lenhart, M. Overmars, T. Shermer, and J, Urrutia. Strictly convex quadrilateralizations of polygons. In Proceedings Fourth Canadian Conference on Computational Geometry, pages 77-83, 1992.
6. H. N. Gabow. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In Proceedings of the 15th ACM Symposium on the Theory of Computing, STOC’83, 448-456, 1983.
7. A. M. H. Gerards. Matching, In Ball et. al, editors, Handbooks in Operations Research and Management Science, vol. 7, "Network Models", chapter 3, North-Holland, 1995.
8. K. Ho-Le. Finite element mesh generation methods: a review and classification. Computer-Aided Design, 20:27-38, 1988.
9. B. Joe. Quadrilateral mesh generation in polygonal regions. Computer-Aided Design, 27:209-222, 1995.
10. R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
11. A. Lubiw. Decomposing polygonal regions into convex quadrilaterals. In Proceedings of the ACM Symposium on Computational Geometry, pages 97-106, 1985.
12. K. Matsumoto, T. Nishizeki, and N. Saito. Planar multicommodity flows, maximum matchings and negative cycles. SIAM J. of Computing, 15:495-510, 1986.
13. R. H. Möhring, M. Müller-Hannemann, and K. Weihe. Using network flows for surface modeling. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '95, pages 350-359, 1995.
14. M. Müller-Hannemann and K. Weihe. Minimum strictly convex quadrangulations of convex polygons. Technical report № 519/1996, Department of Mathematics, Technische Universität Berlins 1996, available via anonymous ftp from ftp.math.tu-berlin.de;cdpub/Preprints/combi; file Report-519-1996.ps.Z (extended abstract appears in the Proceedings of the 13th Annual ACM Symposium on Computational Geometry, SoCG’97, 1997).
15. J. R. Sack. An O(n log n) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals. In Proceedings 20th Conference on Communications, Control, and Computing, pages 64-74, 1982.
16. J. R. Sack and G. Toussaint. A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals. In Proceedings 19th Conference on Communications, Control, and Computing, pages 21-30, 1981.
17. T. Tam and C. Armstrong. Finite element mesh control by integer programming. Ini. J. Numer. Methods Eng., 36:2581-2605, 1993.
18. G. Toussaint. Quadrangulations of planar sets. In Proceedings fth International Workshop on Algorithms and Data Structures, WADS’95, Kingston, Canada, August 16-18, 1995, pages 218-227, 1995.
19. O.C. Zienkiewicz and R.L. Taylor. The finite element method. McGraw Hill, London, 1989.