DocumentCode
1956246
Title
Adaptive Mesh Simplification Using Vertex Clustering with Topology Preserving
Author
Pengdong, Gao ; Ameng, Li ; Yongquan, Lu ; Jintao, Wang ; Nan, Li ; Wenhua, Yu
Author_Institution
High Performance Comput. Center, Commun. Univ. of China, Beijing
Volume
2
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
971
Lastpage
974
Abstract
An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency relationship of all points, the unit normal corresponding to each vertex can be calculated firstly. Then the algorithm adopts the octree structure to subdivide the mesh model adaptively with the guidance of these normal vectors. This subdivision will continue until the angles between the normal vectors in one cell satisfy the predefined threshold. The vertices in this cell are then replaced by a unique vertex, which is a weighted sum of all inside points. Therein, the weight is the normalized cosine value of the angle between the normal and their mean. Experimental results have demonstrated the presented algorithm can not only simplify 3D meshes effectively but also preserve the geometric characters vividly.
Keywords
octrees; pattern clustering; adaptive mesh simplification; adjacency relationship; geometric features; normalized cosine value; octree structure; topology preserving; vertex clustering; Availability; Bandwidth; Clustering algorithms; Computer science; High performance computing; Iterative algorithms; Iterative methods; Software engineering; Solid modeling; Topology; mesh simplification; normal vector; topology preserving; vertex clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-0-7695-3336-0
Type
conf
DOI
10.1109/CSSE.2008.1146
Filename
4722212
Link To Document