基于约束Delaunay三角划分法在节理图上实现网格自动剖分

AUTO-GENERATEING GRID ON JOINT NETWORK MODEL FIGURE BASED ON CONSTRAINT DELAUNAY TRIANGULATION

分析了现有的在节理图上自动生成有限元网格方法的不足之处,提出了应用约束Delaunay三角划分法来实现网格剖分。该方法将所有的节理线看作特征约束线,在散乱点约束的Delaunay三角划分的基础上,逐次嵌入约束线,然后再应用细化算法进行网格加密,得到符合数值计算精度要求的网格。

After analyzing and classifying the wide variety of mesh generation methods for finite element computation,a clear overall picture of all those methods is provided. Performances of Delaunay triangulation are campared,and the merits and disadvantages of exisiting methods in auto-griding on joint network model figure are also discussed. Additionally,a method based on constraint Delaunay triangulation can be available as a substitute. In the method,all joints are treated as characteristic constraints. Based on Delaunay triangulation on disperse points,all constraints are inserted one by one,and then refinement method is employed to make grid denser to meet the precision quest in numerical computation.