Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Computational Science, Engineering & Technology Series
ISSN 1759-3158
Edited by: B.H.V. Topping, L. Lämmer
Chapter 3

Mesh Generation Methods

F. Neugebauer

Department of Computer Science, University of Paderborn, Germany

Full Bibliographic Reference for this chapter
F. Neugebauer, "Mesh Generation Methods", in B.H.V. Topping, L. Lämmer, (Editors), "High Performance Computing for Computational Mechanics", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 3, pp 39-56, 2000. doi:10.4203/csets.4.3
In the following presentation we provide a brief overview of existing mesh generation methods. Since it is impossible to describe all algorithms in detail, only the basic ideas of each method are worked out. For a detailed formulation of the algorithms we refer to papers and books. All discussed mesh generation methods describe a discretization of a two- or three-dimensional domain. Initially a domain described by nodes, edges, faces and/or elements is given and the created mesh also consists of nodes, edges, faces and/or elements.

A mesh has to be "correct", i.e. it should define a valid discretization of the domain into elements. A formal definition of "correct" will be given in the presentation. Furthermore, the mesh has to satisfy requirements depending on the practical application, i.e. all elements should be quadrangles and the mesh has to be conform. The definition of possible requirements will be given in the presentation, too.

purchase the full-text of this chapter (price £20)

go to the previous chapter
go to the next chapter
return to the table of contents
return to the book description
purchase this book (price £75 +P&P)