Mesh refinement via bidirected flows: Modeling, complexity, and computational results

Journal of the ACM

Volumn 44, Issue 3, 1997, Pages 395-426

  Möhring, Rolf H ^a   Müller Hannemann, Matthias ^a   Weihe, Rarsten ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Algorithms; Augmenting paths; b matching problem; Bidirected flows; Design; Experimentation; Mesh generation; Script N sign completeness; Templates

Indexed keywords

COMPUTER AIDED ENGINEERING; COMPUTER NETWORKS; GRAPH THEORY;

AUGMENTING PATHS; BIDIRECT FLOWS; DISCRETE MATHEMATICS; MESH GENERATION;

COMPUTER AIDED DESIGN;

EID: 0031140214     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/258128.258174     Document Type: Article

References (20)

1. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows. Prentice-Hall, Englewood Cliffs, N.J.
2. ANSTEE, R. P. 1987. A polynomial algorithm for b-matching: An alternative approach. Inf. Proc. Lett. 24, 153-157.
3. BABUŠKA, I., AND AZIZ, A. 1976. On the angle condition in the finite element method. SIAM J. Num. Anal. 13, 214-227.
4. BERN, M., AND EPPSTEIN, D. 1992. Mesh generation and optimal triangulation. In Computing in Euclidean Geometry, D.-Z. Du and F. K. Hwang, eds. World Scientific, Singapore, pp. 23-90.
5. DERIGS, U. 1988. Programming in networks and graphs. In Lecture Notes in Economics and Mathematical Systems, vol. 300. Springer-Verlag, Berlin, Germany.
6. EDMONDS, J. 1967. An Introduction to Matching. Lecture Notes. Univ. Michigan, Ann Arbor, Ann Arbor, Mich.
7. HO-LE, K. 1988. Finite element mesh generation methods: A review and classification. Comput. Aided Des. 20, 27-38.
8. JOE, B. 1995. Quadrilateral mesh generation in polygonal regions. Comput. Aided Des. 27, 209-222.
9. KRAUSE, G. 1991. Interactive finite element preprocessing with ISAGEN. Fin. Element News 15.
10. MEHLHORN, K., AND NÄHER, S. 1995. LEDA, A platform for combinatorial and geometric computing. Commun. ACM 38, 2 (Feb.), 96-102.
11. MILLER, D. L., AND PEKNY, J. F. 1995. A staged primal-dual algorithm for perfect b-matching with edge capacities. ORSA J. Comput. 7, 298-320.
12. MÖHRING, R. H., AND MÜLLER-HANNEMANN, M. 1995. Cardinality matching: Heuristic search for augmenting paths. Tech. Rep. no. 439/1995. Technische Universität Berlin, Berlin, Germany. (Available via anonymous ftp from ftp.math.tu-berlin.de; cd pub/Preprints/combi; file Report-439-1995.ps.Z.)
13. MÜLLER-HANNEMANN, M., AND SCHWARTZ, A. 1997. Mesh refinement in quadrilaterals without template restrictions. Manuscript.
14. MÜLLER-HANNEMANN, M., AND WEIHE, K. 1996. Minimum strictly convex quadrangulations of convex polygons. Preprint No. 13. Dept. Math. Comput. Sci., Univ. Konstanz, Konstanz, Germany. (Available via anonymous ftp from ftp.informatik.uni-konstanz.de; cd pub/preprints/1996, file preprint-013 .ps.Z.)
15. PAPADIMITRIOU, C. H., AND STEIGLITZ, K. 1982. Combinatorial Optimization-Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, N.J.
16. PULLEYBLANK, W. 1973. Faces of matching polyhedra. Ph.D. dissertation. Faculty of Mathematics, Univ. Waterloo, Waterloo, England.
17. RIPPENHAUSEN-LIPA, H., WAGNER, D., AND WEIHE, K. 1995. Efficient algorithms for disjoint paths in planar graphs. In DIMACS Series in Discrete Mathematics and Computer Science, vol. 20 (from the special year on combinatorial optimization). American Mathematical Society, Providence, R. I., pp. 295-354.
18. SRINIVASAN, V., NACKMAN, L. R., TANG, J.-M., AND MEHKAT, S. N. 1992. Automatic mesh generation using the symmetric axis transformation of polygonal domains. In Proc. IEEE 80, 1485-1501.
19. STRANG, G., AND FIX, G. J. 1973. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, N.J.
20. TAM, T. K. H., AND ARMSTRONG, C. G. 1993. Finite element mesh control by integer programming. Int. J. Num. Meth. Eng. 36, 2581-2605.