| Optimal tetrahedral mesh generation for three-dimensional point set |
| |
| 引用本文： | 秦开怀,吴边,关右江,葛振州. Optimal tetrahedral mesh generation for three-dimensional point set[J]. 中国科学E辑(英文版), 1997, 40(2): 135-143. DOI: 10.1007/BF02916945 |
| |
| 作者姓名： | 秦开怀 吴边 关右江 葛振州 |
| |
| 作者单位： | Department of Computer Science and Technology，Tsinghua University，Beijing 100084，China，Department of Computer Science and Technology，Tsinghua University，Beijing 100084，China，Department of Computer Science and Technology，Tsinghua University，Beijing 100084，China，Department of Computer Science and Technology，Tsinghua University，Beijing 100084，China |
| |
| 基金项目： | Project supported by the National Natural Science Foundation of China. |
| |
| 摘 要： | 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.
|
Optimal tetrahedral mesh generation for three-dimensional point set |
| |
| Kaihuai Qin,Bian Wu,Youjiang Guan,Zhenzhou Ge. Optimal tetrahedral mesh generation for three-dimensional point set[J]. Science in China(Technological Sciences), 1997, 40(2): 135-143. DOI: 10.1007/BF02916945 |
| |
| Authors: | Kaihuai Qin Bian Wu Youjiang Guan Zhenzhou Ge |
| |
| Affiliation: | (1) Department of Computer Science and Technology, Tsinghua University, 100084 Beijing, China;(2) Present address: Department of Precision Instrument and Mechanics, Tsinghua University, 100084 Beijing, China |
| |
| Abstract: | 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. |
| |
| Keywords: | genetic algorithm tetrahedral mesh generation max-min solid angle Delaunay triangulation. |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
