A Modified Generating Algorithm of Progressive Mesh Model Based on the Importance Degree of Vertex

Article Preview

Abstract:

In order to implement progressive mesh representation of 3D model, improve the computing method of collapse cost in mesh simplification. Firstly, obtains model data from smf data file, and rapidly establishes the 3D model in the memory, and redesigns weight computing method of Garland QEM algorithm. Using the square of the largest deviation of triangular plane normal adjacent to the vertex as the importance degree of vertex, and brings it into error metric formula, progressive mesh is generated by simplifying. The following experiment shows that the algorithm is succinct, and the generating speed of mesh and the contour information of model are well preserved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1030-1032)

Pages:

1623-1626

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhang Yaping, Xiong Hua and so on. A survey of simplification and multiresolution techniques for massive meshes[J]. Journal of Computer-aided Design&Computer Graphics. 2004 (12) 279-282.

DOI: 10.3724/sp.j.1089.2010.10617

Google Scholar

[2] Hoppe H. Progressive meshes [A]. Computer Graphics (SIG-GRAPH Proceeding)[C]. 1996. 99-10.

Google Scholar

[3] Zhou yang etc. A continuous multi-resolution LOD algorithm based on triangle collapse [J]. School of Geodesy and Geomatics. 2004 (12) 279-282.

Google Scholar

[4] Gu Dongdong, Pan Zhengyun. A modified algorithm on progressive mesh simplificaion[J]. Computer Engineering and Design. 2008 (9) 4648-4650.

Google Scholar

[5] Su Zhou, Li Chuanliang. The applicaion research of LOD method based on facet collapse[J]. Computer Engineering and Eesign. 2008 (4) 2008-(2013).

Google Scholar

[6] GU Yao-lin, ZHAO Zheng-ming, WEI Jiang-tao. Multiresolution mesh simplification algorithm with distance-weighted quadric error metric[J]. Computer Engineering and Design. 2007 (4) 1966-(1968).

Google Scholar

[7] Michael Garland. Quadric-Based Polygonal Surface Simplification[D]. 1999, 5, 9.

Google Scholar

[8] Chen Weihai, Xu Lihong. Quadric error metrics for mesh simplification based on feature matrix[J]. Journal of Beijing University of Aeronautics and Astronautics. 2009, 35(5): 572-576.

Google Scholar

[9] DU Xiaohui, Yin Baocai etc. Edge Collapse Simplification Based on Weighted Quadric Error Metrics[J]. Journal of Beijing University of Technology. 2007 33(7) 731-736.

Google Scholar

[10] Chen Yiqun,Cao Jinyin,Lin Shujin. Mesh simplification algorithm based on balanced cost. Computer Engineering and Applications. 2011 47(15) 75-79.

Google Scholar

[11] MANTYLA M. An introduction to solid modeling [M]. Computer Science Press. 1988 110~132.

Google Scholar

[12] Hou Baoming, Cui Hongxia, Liu Xuena. A fast topological reconstruction algorithm for 3d mesh model[J]. Computer Applicaion. 2010 (11) 3002-3004.

DOI: 10.3724/sp.j.1087.2010.03002

Google Scholar