TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

被引:1068
作者
Si, Hang [1 ]
机构
[1] Weierstrass Inst Appl Anal & Stochast WIAS, Res Grp Numer Math & Sci Comp 3, D-10117 Berlin, Germany
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2015年 / 41卷 / 02期
关键词
Design; Algorithms; Performance; Tetrahedral mesh generation; Delaunay; constrained Delaunay; Steiner points; flips; edge removal; boundary recovery; mesh quality; mesh refinement; mesh improvement; CONSTRAINED DELAUNAY; BOUNDARY RECOVERY; TRIANGULATIONS; IMPROVEMENT; ALGORITHM; POLYHEDRA;
D O I
10.1145/2629697
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
TetGen is a C++ program for generating good quality tetrahedral meshes aimed to support numerical methods and scientific computing. The problem of quality tetrahedral mesh generation is challenged by many theoretical and practical issues. TetGen uses Delaunay-based algorithms which have theoretical guarantee of correctness. It can robustly handle arbitrary complex 3D geometries and is fast in practice. The source code of TetGen is freely available. This article presents the essential algorithms and techniques used to develop TetGen. The intended audience are researchers or developers in mesh generation or other related areas. It describes the key software components of TetGen, including an efficient tetrahedral mesh data structure, a set of enhanced local mesh operations (combination of flips and edge removal), and filtered exact geometric predicates. The essential algorithms include incremental Delaunay algorithms for inserting vertices, constrained Delaunay algorithms for inserting constraints (edges and triangles), a new edge recovery algorithm for recovering constraints, and a new constrained Delaunay refinement algorithm for adaptive quality tetrahedral mesh generation. Experimental examples as well as comparisons with other softwares are presented.
引用
收藏
页数:36
相关论文
共 96 条
  • [1] Variational tetrahedral meshing
    Alliez, P
    Cohen-Steiner, D
    Yvinec, M
    Desbrun, M
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (03): : 617 - 625
  • [2] Amenta N., 2003, PROC 19 ANN ACM SYMP, P211, DOI DOI 10.1145/777792.777824
  • [3] [Anonymous], P 9 INT MESH ROUNDT
  • [4] [Anonymous], 2020, TETGEN QUALITY TETRA
  • [5] [Anonymous], 8256 INRIA
  • [6] AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880
  • [8] The Quickhull algorithm for convex hulls
    Barber, CB
    Dobkin, DP
    Huhdanpaa, H
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04): : 469 - 483
  • [9] Bern M., 1995, LECT NOTES SERIES CO, V4, P47, DOI DOI 10.1142/9789812831699_0003
  • [10] Compact representations of simplicial meshes in two and three dimensions
    Blandford, DK
    Blelloch, GE
    Cardoze, DE
    Kadow, C
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2005, 15 (01) : 3 - 24