Automatic unstructured grid generators

https://doi.org/10.1016/S0168-874X(96)00038-8Get rights and content

Abstract

A review of automatic unstructured grid generators is given. These types of grids have found widespread use in computational fluid dynamics, computational structural dynamics, computational electro-magnetics and computational thermodynamics. The following topics are treated: the methods most commonly used, the specification of desired element size/shape and surface definition/meshing. Finally, the use of automatic grid generators as an enabling technology for moving body simulations and adaptive remeshing techniques is discussed.

References (106)

  • R. Löhner

    An adaptive finite element scheme for transient problems in CFD

    Comp. Meth. Appl. Mech. Eng.

    (1987)
  • R. Löhner

    Three-dimensional fluid-structure interaction using a finite element solver and adaptive remeshing

    Comp. Sys. in Eng.

    (1990)
  • T.J. Baker

    Developments and trends in three-dimensional mesh generation

    Appl. Num. Math.

    (1989)
  • B. Joe

    Construction of three-dimensional Delaunay triangulations using local transformations

    ComputerAided Geometric Des.

    (1991)
  • S. Rebay

    Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm

    J. Comp. Phys.

    (1993)
  • R. Löhner

    An adaptive finite element solver for transient problems with moving bodies

    Comp. Struct.

    (1988)
  • T. Strouboulis et al.

    Recent experiences with error estimation and adaptivity; Part 1: Review of error estimators for scalar elliptic problems

    Comp. Meth. Appl. Mech. Eng.

    (1992)
  • Sandia National Laboratories
  • Sandia National Laboratories
  • N. van Phai

    Automatic mesh generation with tetrahedron elements

    Int. J. Num. Meth. Eng.

    (1982)
  • S.H. Lo

    A new mesh Generation scheme for arbitrary planar domains

    Int. J. Num. Meth. Eng.

    (1985)
  • J. Peraire et al.

    Finite element Euler calculations in three dimensions

    Int. J. Num. Eny.

    (1988)
  • R. Löhner

    Some useful data structures for the generation of unstructured grids

    Comm. Appl. Num. Mech.

    (1988)
  • R. Löhner et al.

    Three-dimensional grid generation by the advancing front method

    Int. J. Num. Meth. Fluids

    (1988)
  • J. Peiro et al.

    The generation of triangular meshes on surfaces

  • J. Peraire et al.

    Unstructured finite element mesh generation and adaptive procedures for CFD

    AGARD-CP-464

    (1990)
  • F. Huet

    Génération de Maillage Automatique clans les Configurations Tridimensionelles Complexes Utilisation d'une Méthode de ‘Front’

    AGARD-CP-464

    (1990)
  • J.Z. Zhu et al.

    A new approach to the development of automatic quadrilateral grid generation

    Int. J. Num. Meth. Eny.

    (1993)
  • H. Jin et al.

    Generation of unstructured tetrahedral meshes by the advancing front technique

    Int. J. Num. Meth. End.

    (1991)
  • J. Frykestig

    Advancing front mesh generation techniques with application to the finite element method

  • K. Nakahashi et al.

    Direct surface triangulation using the advancing front method

    AIAA-95-1686CP

    (1995)
  • C.-J. Woan

    Unstructured surface grid generation on unstructured quilt of patches

    AIAA-95-2202

    (1995)
  • T.D. Blacker et al.

    Paving: A new approach to automated quadrilateral mesh generation

    Int. J. Num. Meth. Eng.

    (1992)
  • T.D. Blacker et al.

    Seams and wedges in plastering: A 3-D hexahedral mesh generation algorithm

    Eng. Comput.

    (1993)
  • J.C. Cavendish

    Automatic triangulation of arbitrary planar domains for the finite element method

    Int. J. Num. Meth. Eng.

    (1974)
  • D.T. Lee et al.

    Two algorithms for constructing a Delaunay triangulation

    Int. J. Comp. Inf. Sci.

    (1980)
  • A. Bowyer

    Computing Dirichlet tesselations

    The Comput. J.

    (1981)
  • D.F. Watson

    Computing the N-dimensional Delaunay tesselation with application to Voronoi polytopes

    The Comput. J.

    (1981)
  • J.C. Cavendish et al.

    An approach to automatic three-dimensional finite element generation

    Int. J. Num. Meth. Eng.

    (1985)
  • R.C. Kirkpatrick

    Nearest Neighbor Algorithm

  • D.N. Shenton et al.

    Three-dimensional finite element mesh generation using Delaunay tesselations

    IEEE Trans. on Magnetics

    (1995)
  • T.J. Baker

    Three-dimensional mesh generation by triangulation of arbitrary point sets

  • D.G. Holmes et al.

    The generation of unstructured triangular meshes using Delaunay triangulation

  • P.L. George et al.

    Delaunay's mesh of a convex polyhedron in dimension d. Application to arbitrary polyhedra

    Int. J. Num. Meth. Eng.

    (1992)
  • N.P. Weatherill et al.

    Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints

    Int. J. Num. Meth. Eng.

    (1994)
  • N.P. Weatherill

    The Delaunay triangulation - from the early work in Princeton

  • J. Müller et al.

    A frontal approach for internal node generation in Delaunay triangulations

    Int. J. Num. Meth. Eng.

    (1993)
  • Cited by (137)

    • χ-MeRA: Computationally efficient adaptive mesh refinement of Monte Carlo mesh based tallies

      2023, Annals of Nuclear Energy
      Citation Excerpt :

      This example easily shows the increased computational efficiency created through the use of an AMR algorithm. To accomplish this refinement, there are three components of an AMR algorithm: an error indicator, an optimal mesh criteria, and an algorithm to refine and coarsen the mesh as indicated (Löhner, 1997). Taking each of these components in turn, the error indicator, typically computed based on the error associated with the solution method for the partial differential equation (PDE), is used as the value compared to a refinement criteria.

    • An improved contact detection algorithm for bonded particles based on multi-level grid and bounding box in DEM simulation

      2020, Powder Technology
      Citation Excerpt :

      The cost of spatial ordering is positively related to the number of objects n. For systems that cannot make assumptions about the spatial consistency of an object, sorting requires multiple operations. Common spatial sorting methods include: grid subdivision [7], adaptive grid [12], octree method, body based cells, spatial heapsort and other methods. By determining the relative order of the spatial arrangement of the particles, these methods eliminate particles that are too far away from the target particles (the particles are impossible to be in contact with the target object because they are too far from it).

    • Voxelization-based high-efficiency mesh generation method for parallel CFD code GASFLOW-MPI

      2018, Annals of Nuclear Energy
      Citation Excerpt :

      In unstructured meshes, various shapes, like triangle in 2d domains, prism and tetrahedron in 3d domains, are used to construct the mesh. Techniques like the advancing front method and Delaunay triangulation (Löhner, 1997) make it possible for the user to obtain the mesh by a “one-click” operation thus avoiding the complicated multi-parameter tuning. However, a huge number of cells and poor mesh quality often associated with unstructured meshes results in shortcomings with respect to the calculation speed and precision of the computation.

    • An adaptive mesh refinement method for a medium with discrete fracture network: The enriched Persson's method

      2014, Finite Elements in Analysis and Design
      Citation Excerpt :

      Though there also exist various smoothing and improving methods of triangulation, the Laplacian smoothing [9–11], some optimization-based smoothing schemes [12–14], the priori-based approach [15], the geometric element transformation method [16] and so on, most of them cannot handle problems with complex interior fractures. Detailed discussion can be referred in articles [16–18]. Another alternative but different way to construct complex geometries of discrete fracture networks is the meshfree or meshless method.

    View all citing articles on Scopus
    View full text