×

zbMATH — the first resource for mathematics

3D anisotropic unstructured grid generation. (English) Zbl 1103.76054
Summary: This paper describes a fully automatic 3D anisotropic mesh generation for domains of arbitrary shape. The spacing of the boundary mesh is computed by the analysis of principal curvatures and directions of boundary surfaces. The spacing in the domain is obtained by interpolation of the spacing at the boundaries on a suitably constructed background mesh. Examples which illustrate the performance of the proposed methodology are presented.

MSC:
76M99 Basic methods in fluid mechanics
65M50 Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Peraire, International Journal for Numerical Methods in Engineering 26 pp 765– (1988)
[2] Borouchaki, Finite Elements in Analysis and Design 25 pp 61– (1997) · Zbl 0872.65124
[3] Borouchaki, International Journal for Numerical Methods in Engineering 49 pp 233– (2000)
[4] Marcum, AIAA Journal 33 pp 1619– (1995)
[5] Delaunay Triangulation and Meshing. Hermes, 1998.
[6] Baker, Engineering with Computers 5 pp 161– (1989)
[7] Curves and Surfaces for Computational Aided Geometric Design. A Practical Guide. Academic Press: New York, 1997.
[8] . Mesh adaption on 2-D unstructured mesh, in computational mesh adaptation. In Notes on Numerical Fluid Dynamics, Hills DP et al. (eds), 1999; 187–204.
[9] Bowyer, Computer Journal 24 pp 162– (1981)
[10] Watson, Computer Journal 24 pp 167– (1981)
[11] . Mesh Generation. Application to Finite Elements. Hermes, 2000.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.