CSpace
Collapsing simplification of triangular mesh based on genetic algorithm
Duan, Li-Ming1,2; Yang, Shang-Peng1,2; Zhang, Xia3; Ren, Hua-Qiao1,2; Shen, Kuan1
2018
摘要To solve the problem that the triangular mesh model which deals with large amount of data will bring great pressure to the computer, a triangle collapsing simplification method based on genetic algorithm was proposed in this paper. In this method, the gravity of the triangles was first derived, the new coordinates were calculated by using the three coordinates of the gravity and the three initialized step lengths, the vertex population was obtained through repeating the above operation several times, the minimum point of fitness value was calculated by using genetic algorithm, the optimal collapsing point was obtained after appropriate amendment, and finally, the sequence of the triangles and collapsing simplification were made according to the simplified error and the proportion of input simplification, respectively. The fitness function adopted in this paper was the quotient of the simplified error and the triangle normalization coefficient. The proposed method was used to achieve the simplification of the triangular mesh model of the flower and the vase, whose volume change rates were 0.0106% and 0.2%, respectively. Besides, their normalized coefficients increased by 11.0% and 4.56%, respectively, which were better than the other methods. The experimental results show that the method proposed can not only simplify the model effectively but also remain its shape as well as improve the quality of the triangular. © 2018, Science Press. All right reserved.
DOI10.3788/OPE.20182606.1489
发表期刊Guangxue Jingmi Gongcheng/Optics and Precision Engineering
ISSN1004924X
卷号26期号:6页码:1489-1496
收录类别EI
语种中文