Study of 3D finite element tetrahedral mesh automatic generation for complex regions

被引:0
|
作者
Wu Huo-zhen [1 ]
Jiao Yu-yong [1 ]
Li Hai-bo [1 ]
Zhang Xiu-li [1 ]
机构
[1] Chinese Acad Sci, Inst Rock & Soil Mech, State Key Lab Geomech & Geotech Engn, Wuhan 430071, Hubei, Peoples R China
关键词
constraints; Delaunay triangulation; mesh generation; complex regions;
D O I
暂无
中图分类号
P5 [地质学];
学科分类号
0709 ; 081803 ;
摘要
Based on the classical 3D Delaunay tetrahedral mesh generation method, a 3D constrained Delaunay triangulation algorithm is presented. By restoring the constrained boundary and removing the local degeneracies, the consistency of the solid boundary and the uniqueness of the mesh could be guaranteed. In this way, the constrained Delaunay triangulation method could be applied effectively to generate tetrahedral mesh for any complex 3D solids with the constraints. By controlling the ratio value of the circumradius of the tetrahedron to its shortest edge length (denoted as a), and the ratio of the volume of the tetrahedron to the volume of its circumscribing sphere (denoted as n), the low-quality elements are avoided; and also a method to calculate the a and n which simplifying the calculation process is proposed. For the entity with complicated geometry, especially the entity containing the thin layers, adding constraints could improve the mesh quality and shorten the calculation time. So, by using the method, the 3D finite element mesh for complex region under different geological conditions could be automatically generated in the civil engineering; and the high quality of the mesh which could be guaranteed provides sufficient condition for the high-precision finite element calculation. The verified examples show that the high-quality constrained tetrahedral mesh for any complex 3D solids could be generated by the constrained Delaunay triangulation method; and it could be applied effectively to the finite element mesh generation in engineering.
引用
收藏
页码:3479 / 3486
页数:8
相关论文
共 19 条
  • [1] COMPUTING DIRICHLET TESSELLATIONS
    BOWYER, A
    [J]. COMPUTER JOURNAL, 1981, 24 (02): : 162 - 166
  • [2] Chew L. P., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P391, DOI 10.1145/262839.263018
  • [3] CUI Ling-guo, 2006, MACHINERY DESIGN MAN, P61
  • [4] SIMULATION OF SIMPLICITY - A TECHNIQUE TO COPE WITH DEGENERATE CASES IN GEOMETRIC ALGORITHMS
    EDELSBRUNNER, H
    MUCKE, EP
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (01): : 66 - 104
  • [5] The boundary recovery and sliver elimination algorithms of three-dimensional constrained Delaunay triangulation
    Guan, Zhenqun
    Song, Chao
    Gu, Yuanxian
    [J]. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2006, 68 (02) : 192 - 209
  • [6] GENERALIZED DELAUNAY TRIANGULATION FOR PLANAR GRAPHS
    LEE, DT
    LIN, AK
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (03) : 201 - 217
  • [7] [骆冠勇 LUO Guanyong], 2007, [计算力学学报, Chinese Journal of Computational Mechanics], V24, P917
  • [8] Shewchuk J. R., 1998, Proceedings of the Fourteenth Annual Symposium on Computational Geometry, P76, DOI 10.1145/276884.276893
  • [9] Shewchuk J.R., 2003, P 19 ANN S COMP GEOM, P181
  • [10] Shewchuk J. R., 2002, P 11 INT MESH ROUNDT, P193