Abstract
Conformal mesh refinement has gained much attention as a necessary preprocessing step for the finite element method in the computer-aided design of machines, vehicles, and many other technical devices. For many applications, such as torsion problems and crash simulations, it is important to have mesh refinements into quadrilaterals. In this paper, we consider the problem of constructing a minimumcardinality conformal mesh refinement into quadrilaterals. However, this problem is NP-hard, which motivates the search for good approximations. The previously best known performance guarantee has been achieved by a linear-time algorithm with a factor of 4. We give improved approximation algorithms. In particular, for meshes without so-called folding edges, we now present a 2-approximation algorithm. This algorithm requires O(n m log n) time, where n is the number of polygons and m the number of edges in the mesh. The asymptotic complexity of the latter algorithm is dominated by solving a T-join, or equivalently, a minimum-cost perfect b-matching problem in a certain variant of the dual graph of the mesh. If a mesh without foldings corresponds to a planar graph, the running time can be further reduced to O(n 3/2 log n) by an application of the planar separator theorem.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
U. Derigs. Programming in networks and graphs: on the combinatorial background and near-equivalence of network flow and matching algorithms. Springer, 1988.
J. Edmonds and E.L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5:88–124, 1973.
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.
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.
A. M. H. Gerards. Matching. In Ball et. al, editors, Handbooks in Operations Research and Management Science, vol. 7, “Network Models”, chapter 3, NorthHolland, 1995.
K. Ho-Le. Finite element mesh generation methods: a review and classification. Computer-Aided Design, 20:27–38, 1988.
B. Joe. Quadrilateral mesh generation in polygonal regions. Computer-Aided Design, 27:209–222, 1995.
R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177–189, 1979.
A. Lubiw. Decomposing polygonal regions into convex quadrilaterals. In Proceedings of the ACM Symposium on Computational Geometry, pages 97-106, 1985.
K. Matsumoto, T. Nishizeki, and N. Saito. Planar multicommodity flows, maximum matchings and negative cycles. SIAM J. of Computing, 15:495–510, 1986.
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.
M. Müller-Hannemann and K. Weihe. Minimum strictly convex quadrangulations of convex polygons. Technical report No. 519/1996, Department of Mathematics, Technische Universität Berlin; 1996, available via anonymous ftp from ftp.math.tu-berlin.de; cd pub/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).
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.
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.
T. Tam and C. Armstrong. Finite element mesh control by integer programming. Int. J. Numer. Methods Eng., 36:2581–2605, 1993.
G. Toussaint. Quadrangulations of planar sets. In Proceedings 4th International Workshop on Algorithms and Data Structures, WADS'95, Kingston, Canada, August 16-I8, 1995, pages 218–227, 1995.
O.C. Zienkiewicz and R.L. Taylor. The finite element method. McGraw Hill, London, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller-Hannemann, M., Weihe, K. (1997). Improved approximations for minimum cardinality quadrangulations of finite element meshes. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_28
Download citation
DOI: https://doi.org/10.1007/3-540-63397-9_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63397-6
Online ISBN: 978-3-540-69536-3
eBook Packages: Springer Book Archive