17th GAMM-Seminar Leipzig on
Construction of Grid Generation Algorithms

Max-Planck-Institute for Mathematics in the Sciences
Inselstr. 22-26, D-04103 [O->]Leipzig
Phone: +49.341.9959.752, Fax: +49.341.9959.999

  17th GAMM-Seminar
February, 1st-3rd, 2001
  Abstracts ->
  All seminars  
  All proceedings  
  Abstract Joachim Schöberl, Fri, 09.00-09.50 Previous Contents Next  
  NETGEN: Algorithms and Visions
Joachim Schöberl (Uni Linz)

Automatic mesh generation requires a couple of algorithms. In this talk I will present the overall strategy and some details of the chosen algorithms of the tetrahedral mesh generator NETGEN. Emphasis is given to the reusable parts.

The strategy is top down, first corners, then edges, faces and finally the volume. Depending on the type of geometry description, the first two steps are more or less involved. Surface mesh generation is performed by the advancing front method. By providing a few functions, the same code can be adapted to various classes of surface models. The volume mesh is generated by the Delaunay algorithm, boundary constraints are achieved by backtracking strategies. We discuss the special parts for constructive solid geometry (CSG) and triangulated surface (STL) geometry models.

One of the strengths of the top-down strategy is the possibility to generate coarse meshes. This is advantageous for adaptivity, geometric multigrid methods, high order FEM and more.

Recent and future work is anisotropic mesh generation for thin domains, and small holes or roundings. Anisotropic mesh refinement is realized in a uniform way.

More information and the code are available from [O->]here.

    Previous Contents Next  

Last updated:
30.11.2004 Impressum
Concept, Design and Realisation
[O->]Jens Burmeister (Uni Kiel), Kai Helms (MPI Leipzig)
Valid HTML 4.0!