Optimal tetrahedral mesh generation for three-dimensional point set

作     者：秦开怀 吴边 关右江 葛振州 

作者机构：Department of Computer Science and Technology Tsinghua University Beijing 100084 China 

出 版 物：《Science China(Technological Sciences)》 (中国科学（技术科学英文版）)

年 卷 期：1997年第40卷第2期

页      面：135-143页

核心收录：

学科分类：1305[艺术学-设计学（可授艺术学、工学学位）] 0810[工学-信息与通信工程] 13[艺术学] 08[工学] 081104[工学-模式识别与智能系统] 0804[工学-仪器科学与技术] 0805[工学-材料科学与工程（可授工学、理学学位）] 081101[工学-控制理论与控制工程] 0811[工学-控制科学与工程] 0702[理学-物理学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Project supported by the National Natural Science Foundation of China 

主　　题：genetic algorithm tetrahedral mesh generation max-min solid angle Delaunay triangulation. 

摘      要：Three-dimensional (3D) tnangulation is a basic topic in computer graphics. It is considered very difficult to obtain the global optimal 3D triangulatlon, such as the triangulation which satisfies the max-min solid angle criterion A new method called genetic tetrahedral mesh generation algorithm (GTMGA for short) is presented. GT-MGA is based on the principle of genetic algorithm and aims at the global optimal triangulation. With a multi-objective fitness function, GTMGA is able to perform optimizations for different requirements. New crossover operator and mutation operator, polyhedron crossover and polyhedron mutation, are used in GTMGA. It is shown by the experimental results that GTMGA works better than both the 3D Delaunay triangulation and the algorithm based on local transformations.