Abstract
The finite element analysis in engineering applications comprises three phases: domain discretization, equation solving and error analysis. The domain discretization or mesh generation is the pre-processing phase which plays an important role in the achievement of accurate solutions. In this paper, the improvement of one particularly promising technique for generating two-dimensional meshes is presented. Our technique shows advantages and efficiency over some currently available mesh generators.
Zusammenfassung
Die Anwendung des Verfahrens der Finiten Elemente im Ingenieurwesen umfaßt drei Schritte: Die Diskretisierung des Bereichs, die Gleichungsauflösung und die Fehleranalyse. Die Bereichsdiskretisierung oder Netzgeneriezung spielt als Vorläufer-Schritt eine wichtige Rolle für die Erzielung genauer Ergebnisse. In dieser Arbeit wird eine vielversprechende Technik zur Generierung zweidimensionaler Netze weiter verbessert. Unser Vorgehen erweist sich einigen derzeit verfügbaren Netzgeneratoren überlegen.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
P. R. Brown, D. R. Hayhurst, Using the Schwarz-Christoffel transformation in mesh generation for the solution of two-dimensional problems, Comp. Mech. Engrg Aug 1982, pp. 73–79.
A. Bykat, Design of a recursive shape controlling mesh generator. Int. J. Num. Meth. Engrg19 (1983), pp. 1375–1390.
J. C. Cavendish, Automatic triangulation of arbitrary planar domains for the finite element method, Int. J. Num. Meth. Engrg8 (1974), pp. 679–696.
C. O. Frederick et al., Two-dimensional automatic mesh generation for structural analysis, Int. J. Num. Meth. Engrg2 (1970), pp. 133–144.
J. Fukuda, J. Suhara, Automatic mesh generation for finite element analysis, Adv. in Computational Methods in Structural Mechanics and Designs, Eds J. T. Oden, R. W. Clough, Y. Yamamoto, UAH Press 1972.
L. R. Hermann, Laplacian-isoparametric grid generation scheme, J. Engrg Mech. Div. ASCE102 (1976), pp. 749–756.
K. Ho-Le, Finite element mesh generation methods: a review and classification, CAD20 (1988), pp. 27–38.
S. H. Lo, A new mesh generation scheme for arbitrary planar domains, Int. J. Num. Meth. Engrg21 (1985), pp. 1403–1426.
R. Löhner, Three-dimensional grid generation by the advancing-front method, Fifth Int. Conf. Num. Meth. in Laminar and Turbulent Flow 1987, pp. 1092–1105.
A. Maus, Delaunay triangulation and the convex hull ofn points in expected linear time, BIT24 (1984), pp. 151–163.
A. O. Moscardini, M. Cross, B. A. Lewis, Assessment of three automatic triangular mesh generators for planar regions, Adv. Engrg Software3 (1981), pp. 108–114.
J. M. Nelson, A triangulation algorithm for arbitrary planar domains, Appl. Math. Modelling2 (1978), pp. 151–159.
S. W. Sloan, A fast algorithm for constructing Delaunay triangulation in the plane, Adv. Engrg Software9 (1987), pp. 34–55.
V. N. Hanh, Mesh generation for finite element analysis, Master thesis, Concordia University, 1988.
M. A. Yerry, M. S. Shephard, A modified quadtree approach to finite element mesh generation, IEEE Comp. Graph. App.3 (Jan 1983), pp. 39–46.
O. C. Zienkiewicz, D. V. Phillips, An automatic mesh generation scheme for plane and curved surfaces by isoparametric coordinates, Int. J. Num. Meth. Engrg3 (1971), pp. 519–528.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bui, T.D., Hanh, V.N. Automatic mesh generation for finite element analysis. Computing 44, 305–329 (1990). https://doi.org/10.1007/BF02241271
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02241271