Cluster-based three-dimensionalnon-uniform mesh simplificationalgorithm

The Cluster-based three-dimensional non-uniform mesh simplification algorithm based on edge-collapse mesh simplification is proposed to solve some practical problems. At first, we adapt K-means algorithm to cluster the mesh triangles and divide them into several model blocks. Secondly, we simplify each model block. In order to keep the feature points of mesh triangles of each block, here we introduce a non-uniform algorithm combined with Gaussian curvature. We can obtain the detail information of different groups by simplifying each of blocks which are independent to each other. If some details are lost in transmission, other details can also decode independently. We only need to ask server to resend the lost part of the group data. At the same time, the regional details can be decoded depend on our viewpoint when we need to load the complex models. Because our vision can only focus on part region of model, and the area in which we aren´t interested can be instead by coarse model.