• DocumentCode
    1554899
  • Title

    Comparison of four-point adding algorithms for Delaunay-type three dimensional mesh generators

  • Author

    Kanaganathan, S. ; Goldstein, N.B.

  • Author_Institution
    Harvey Mudd Coll., Claremont, CA, USA
  • Volume
    27
  • Issue
    3
  • fYear
    1991
  • fDate
    5/1/1991 12:00:00 AM
  • Firstpage
    3444
  • Lastpage
    3451
  • Abstract
    Four different approaches to generating three-dimensional tetrahedral meshes were tested and compared in regard to the complexity and quality of the elements they produce as points are added into the existing coarse meshes. Points are added according to Delaunay triangulation. It was found that there is a marked difference between the different approaches and that the method suggested by D.F. Watson (1981) is the better one in terms of quality of the meshes generated, although its time complexity is a little higher than that of the other methods
  • Keywords
    computational complexity; computational geometry; data structures; finite element analysis; Delaunay triangulation; Delaunay-type three dimensional mesh generators; coarse meshes; complexity; data structures; finite element mesh generation; four-point adding algorithms; three-dimensional tetrahedral meshes; Algorithm design and analysis; Computer aided software engineering; Finite element methods; Geometry; Joining processes; Mathematical model; Mesh generation; Testing; Tiles;
  • fLanguage
    English
  • Journal_Title
    Magnetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9464
  • Type

    jour

  • DOI
    10.1109/20.79087
  • Filename
    79087