任意平面区域有限元三角形网格全自动剖分
Keywords: 有限元网格自动剖分,Delaunay三角剖分,平面任意区域
Abstract:
基于Ｄｅｌａｕｎａｙ三角化技术，提出了一种对任意平面区域生成三角形网格的全自动生成算法．此算法具有网格质量好，区域适应性强，自动化程度高等优点算法还包括了网格的均匀化及加密处理等．通过利用ＡＲＸ对ＡｕｔｏＣＡＤ进行二次开发实现了该算法，大量算例也证明了此算法的可靠性和适用性．
| [1] | SIBSON R. Locally equiangular triangulations[J]. Computer J, 1978, 21(3): 243-245.
|
| [2] | NELSON J M. A triangulation algorithm for arbitrary planar domains[J]. Appl Math Modeling, 1978, 2: 151-159.
|
| [3] | WATSON D F. Comptuting the n-dimensional Delaunay tessellation with application to Voronoi polytopes[J] .Comput J, 1981, 24(2): 167-172.
|
| [4] | CAVENDISH J C. Automatic triangulation of arbitrary planar domains for the finite element method[J]. Int JNumer Meht Eng, 1974, 8: 679-696.
|
| [5] | LO S H. A new mesh generation scheme for arbitrary planar domains[J]. Int J Numer Meth Eng, 1985, 21:1403-1426.
|
Full-Text
