An efficient optimization procedure for tetrahedral meshes by chaos search algorithm

Journal of Computer Science and Technology

Volumn 18, Issue 6, 2003, Pages 796-803

  Sun, ShuLi ^a   Liu, JianFei ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Chaos search algorithm; Element shape measure; Mesh optimization; Smoothing

Indexed keywords

ALGORITHMS; CHAOS THEORY; COMPUTER SIMULATION; FINITE ELEMENT METHOD; OPTIMIZATION;

CHAOS SEARCH ALGORITHM; ELEMENT SHAPE MEASURE; MESH OPTIMIZATION; SOFTWARE PACKAGE AUTOMESH3D;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0348226088     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02945469     Document Type: Letter

References (21)

1. Freitag L A, Ollivier-Gooch C. A cost/benefit analysis of simplicial mesh improvement techniques as measured by solution efficiency. Int. J. Comput. Geom. Appl., 2000, 10(4): 361-382.
2. Joe B. Delaunay versus max min solid angle triangulations for 3-dimensional mesh generation. Int J. Numer. Meth. Engng., 1991, 31(5): 987-997.
3. Joe B. Construction of 3-dimensional improved-quality triangulations using local transformations. SIAM. J. Sci. Comput., 1995, 16(6): 1292-1307.
4. Zavattieri P D, Dari E A, Buscaglia G C. Optimization strategies in unstructured mesh generation. Int. J. Numer. Meth. Engng., 1996, 39(12): 2055-2071.
5. Freitag L A, Ollivier-Gooch G. Tetrahedral mesh improvement using swapping and smoothing. Int. J. Numer. Meth. Engng., 1997, 40(21): 3979-4002.
6. Lo S H. Optimization of tetrahedral meshes based on element shape measures. Comput. Struct., 1997, 63(5): 951-961.
7. Freitag L A, Plassmann P. Local optimization-based simplicial mesh untangling and improvement. Int. J. Numer. Meth. Engng., 2000, 49(1-2): 109-125.
8. Kondo K. Three-dimensional finite element meshing by incremental node insertion. Int. J. Numer. Meth. Engng., 1996, 39(20): 3519-3534.
9. Radovitzky R, Ortiz M. Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation. Comput. Meth. Appl. Mech. Engng., 2000, 187(3-4): 543-569.
10. Lo S H. A new mesh generation scheme for arbitrary planar domains. Int. J. Numer. Meth. Engng., 1985, 21(8): 1403-1426.
11. Field D A. Laplacian smoothing and Delaunay triangulations. Commun. Appl. Numer. Meth., 1988, 4(6): 709-712.
12. Freitag L, Jones M, Plassmann P. A parallel algorithm for mesh smoothing. SIAM. J. Sci. Comput., 1999, 20(6): 2023-2040.
13. Liu A, Joe B. Relationship between tetrahedron shape measures. BIT, 1994, 34: 268-287.
14. Li B, Jiang W S. Optimizing complex functions by chaos search. Cybernetics and Systems, 1998, 29(4): 409-419.
15. Xu H P, Zhu Y, Zhang T, Wang Z C. Application of mutative scale chaos optimization algorithm in power plant units economic dispatch. Journal of Harbin Institute of Technology, 2000, 32(4): 55-58. (in Chinese)
16. Kennon S R, Dulikravich G S. Generation of computational grids using optimization. AIAA J., 1986, 24(7): 1069-1073.
17. Zhang H, Trepanier J Y. An algorithm for the optimization of directionally stretched triangulations. Int. J. Numer. Meth. Engng., 1994, 37(9): 1481-1497.
18. Lo S H. Volume discretization into tetrahedral - II. 3D-triangulation by advancing front approach. Comput. Struct., 1991, 39(5): 501-511.
19. Liu J F. User Manual of AutoMesh3D - A mesh generator for 3-D solid modeling. Technical report, 2001, Department of Mechanics and Engineering Science, Peking University. (in Chinese)
20. Liu J F. Automatic triangulation of n-D domains. In Proc. CAD/Graphics'91, Hangzhou, China, 1991, pp.238-241.
21. Liu J F. Pre-processor of FEM [Dissertation]. Beijing University of Aeronautics and Astronautics, 1991. (in Chinese)