具有大量椭圆颗粒/孔洞随机分布区域的计算机模拟及其改进三角形自动网格生成算法

Computer simulation method for the domain with large numbers of random ellipse grains/cavities and the improving automatic triangle mesh generation algorithm

针对颗粒/孔洞为椭圆形状并且呈随机分布的多相复合材料给出了一种计算机模拟方法,同时针对这样复杂的二维区域提供了一个改进的快速自动三角形网格剖分算法。最后用实例说明了算法的有效性。此算法可以推广到三维情形、裂纹材料等。

The computer simulation method for the composite material with large numbers of random ellipse grains/cavities is presented. Based on the ellipses covering the grains/cavities of any shape, we give one method to simulate the grains/cavities of any shape by shorting or longing the axis of the ellipse or cutting the ellipse boundary. At the same time, considering the difficulty of the other software such as Sap91, ANSYS and Matlab, etc. not to generate the mesh of the above domain with large number of grains/cavities, we give one improving algorithm of the automatically generate triangle mesh based on the P.L. George algorithm. For different uses of the mesh, two kinds of boundary points (adaptive original points, almost original points) are described. Based on the different boundary points, we present the algorithm to generate the different mesh for the complicate domain with large number of grains/cavities. Some numerical experiments in the two-dimension domain illustrate that the algorithm is valid to simulate the composite materials with large numbers of random grains/cavities. The algorithm can be extended to deal with the materials with cracks and 3-dimensional cases without any difficulty.