摘要
网格自动生成是进行有限元分析和计算的重要前提。在当前二维四边形网格生成方法中,铺路算法自动化程度高、生成的单元质量好,是一种非常值得研究的网格生成的算法。但原算法存在一些不足,对此本文做了的改进和创新,提高了算法的稳定性和可靠性。加入网格质量优化算法和节点编号优化算法,提高了网格质量、减少了总刚度矩阵的半带宽,引入了网格加密算法,提高了网格计算精度。基于改进后算法编制了网格自动生成器,用此生成器产生大量实例,证明了改进算法的有效性。
The automatic mesh generation is the important precondition of finite element analysis and calculation. In the recent methods of two-dimensional quadrilateral mesh generation, the paving method is worthy of studying, which possesses properties of high automatization degree and generating excellent element. But the deficiency of this method still exists. For enhancing the reliability and applicability of the method, this paper makes some beneficial improvement. The quality of the mesh has been improved and the half-bandwidth of the global stiffness matrix has been decreased by adding the algorithm for mesh quality optimization and the algorithm for the optimizing of node number. The accuracy has been improved by introducing the algorithm for mesh encryption. According to the improved algorithm method, the automatic mesh generator has been developed , many examples that have been created by using this generator is proved to the efficiency of the improved algorithm.
引文
1关振群,宋超,顾元宪等.有限元网格生成方法研究的新进展[J].计算机辅助设计与图形学学报. 2003.7,vol.15 No.1:1-11
2胡恩球,张新房.有限元网格生成方法发展综述[J].计算机辅助设计与图形学学报. 1999.4 ,vol.9 No.4:378-383
3崔建,江雄心,游步东.二维有限元网格生成方法[J].南昌大学学报(工科版) 2003.7,vol.25 No.2:150-157
4张玉峰,朱以文.有限元网格自动生成典型方法与研究前瞻[J].武汉大学学报. 2005.4 vol.38 No.2:28-31
5吴淑芳,傅沛福.网格自动重分及细化技术[J].塑性工程学报. 1997.5, vol.3 No.3:65-72
6杜平安.有限元网格划分的基本原则[J].机械设计与制造. 2000.9, 8(4)1:34-36.
7任华.有限元自适应网格生成技术解析[J].新余高转学报. 2006.4 , vol.11 No.2: 94-103
8 K.Ho-Le finite element Automatic generation of quadrilateral elements by aConformal mapping. Eng.comput,1985,2:187一194.
9 CendesZ Shenton D,Shahnasser H.Magnetic field computation using DelaunayTriangulation and complementary finite element methods[J].IEEE Trans Mag,1983,19(6):2551~2557.
10 Rainald Lohner,Paresh Parikh,Clyde Gumbert.Interactive Generation of Ustructured Grid for Three Dimensional Problems,Numerical Grid Generation in Computational Fluid Mechanics,Pineridge Press,687-697,1988
11 Rainald Lohner, Progress in Grid Generation via the Advancing Front Technique, Engineering with Computer,vol 12,186-210,1996.
12 S.H.Lo,Volume Discretization into Tetrahedra-l.Verification and Orientation of Boundary , Compute and Structures,vol39,no493-500,1991
13 S.H.Lo,Volume Discretization into Tetrahedra.II,3D Triangulation by Advancing Front Approach, Computers and structures,vol.39,No.5.501-511,1991
14 ANSYS web site http://www.ansys.com.
15 C.L.Lawson ,for C Surface Interpolation, mathematic III,161-194,1977
16 David E Watson ,Computating the Delaunay Tesselation with Application to vornonoi Polytopes, the computer Journal,vol 24(2),167-172,1981.
17 Timothy J.Baker, Automatic Mesh Genaration For Complex Three-Dimensional Regions Using Constrained Delaunay Triangulation ,Engineering with Computers, vol5, 161-175,1989
18 N.P.Weatherill,O.Hassan. Efficient Three-dimensional Delaunay Triangulation with Automatic Point Creation and Imposed Boundary Contraints, International Journal For Numerical Methods in Engineeriong ,vol.37,2005-2039,1994
19 P.L.George, F.Hecht, E.Saltel, Automatic Mesh Generator with Specified Boundary,Computer,Methods in Applied Mechanics and Engineering ,North-Holland , vol.92,269-288,1991
20 Paul L.Chew,Guaranteed-Quality Triangular Meshes ,TR 89-983, Department of Computer Science,CornellUniversity , Ithaca ,NY,April 1989
21 Jim Ruppert, A New and Simple Algorithn For Quality 2-Dimensional Mesh Generation, Technical Report UCB/CSD 92/694, University of California at Berkely ,Berkely Caniformia, 1992
22 Jonathan Richard Shewchuck, Triangle:2D Quality Mesh Generatior and Delaunay Triangulator.1996
23 S.Rebay, Efficient Unstructured Mesh Generation By Means of Delaunay Triangulation and Bowyer-Watson Algorithm , Jouunal of Computational Physics ,vol.106,125-138,1993
24 David L. Marcum,Nigel P. Weatherill, Ustructured Grid Generation Using Iterative Point Insertion and Local Reconnection ,AIAA Journal ,vol33,no9,1619-1625,September 1995
25 DavidL.Marcum,Solidmeshwebsite:http://www.erc.msstate.edu/thrusts/grid/solid-mesh
26 H . Borouchaki , F.Hecht, E .Saltel, P. L.George ,Reasinably Efficient Delaunay Based MeshGenerator in 3 Dimensions , Proceeding International Meshing Rountable , 3-14, October 1995
27 Barfield .W.D Numerical method for generating orthogonal curvilinear meshes[J] , Computationnal Physics ,1970.5:23-33
28 Baldwin K H and Schreyer H L. Automatic generation of quadrilateral elements by a conformal mapping .Eng.comput.1985.2:187-194
29 Barfield WD Numerical method for generating orthogonal curvilinear meshes[J] , ASME, J,ENG,FOR Industry .1973:332-338
30 Cavendish J C. Automatic Triangulation of Arbitrary Planar Domains for the Finite Element Mesh Generatio Int J.N um. Mesh. Eng. 1974,4(8):679-696
31 Lo.S.H.A New Mesh Generation scheme for Arbitrary Planar Domains Int. J.Num. Mech. Eng,1985(21):1403-1426.
32 Shaw J C and Pitchen R G.Modifications to the Suhara-Fukude method of net work generation. Int.J.Num.Mesh.Eng.1978,1(12):93-99
33 B.Joe and R.B .Simpson .Triangular mesh for regions of complicated shaped, Int, J.Num. Mech Eng., 1986.5(23):751-778.
34 E. A Sadek , A Scheme for the automatic generation of triangular finite elements , Int . J.Numer. Methods Eng. 1980.12(15): 1813-1822.
35 J.Z.Zhu, et al,Anew approach to the automatic quadrilateral mesh generation 1991,4(32):849-866.
36 Thacker WC,Gonzalez A & Putland GE,A method for automating the construction of irregular computational Grids for storm surge forcast models,[J].Comp.Phys.1980,3(37):371-387.
37 M.A. Yerry ,M.S.Shephard, A Modified quadtree approach to finite element mesh generation.IEEE Computer Graphics and Applications,1983,1(3):39-46.
38李华,陈耿东.一种新的四边形网格快速生成方法—模板法[J].计算结构力学及其应用. 1996,13.1:26-33
39李华,李笑天.一种全四边形网格生成方法—改进模板法[J].计算力学学报,2002,19(1):16-19
40吴淑芳,姚圣雄.基于约束的网格向前推进生成技术[J].计算机辅助设计与图形学学报. 2003.1,vol.15 No.1:1-10
41陈涛,李光耀.基于散乱点的全自动四边形网格剖分方法[J].机械工程学报. 2007.2 ,18(3):308-312
42赵熠,赵建军.前沿法生成四边形网格的改进方法[J].计算机工程与应用. 2002.9,64-98
43王世军,赵金娟.四边形有限元网格的快速生成算法[J].计算机辅助设计与图形学学报. 2003.5,15(5):631-634
44李发致,石晓祥.四边形单元网格生成与实现方法[J].锻压技术. 2000.2 ,10(1):15-18
45吴淑芳,张树仁.四叉树法生成网格的几何复杂度[J].兵工学报. 2000.8, vol.21 No3:282-285
46黄晓东,杜群贵.二维有限元网格的局部加密方法[J].华南理工大学学报. 2004.12, vol.32 No.12:45-53.
47陈立岗,郑耀.全四边形有限元网格的拓扑优化策略[J].计算机辅助设计与图形学学报. 2007.6,19(1):78-83
48赵登虎,李志敏.有限元方法中网格编码的优化问题[J].工科数学.2001.4 ,vol.17 No.2:21-28.