A segmentation progressive mesh compression method

The progressive mesh compression algorithm on the blocks of model based on edge-collapse mesh simplification is proposed to solve some practical problems. At first, we adopt K-means to cluster the mesh triangles. Secondly, we compress each model block. The detail information of different groups obtained by compressing each of blocks are independent of each other. If some details are lost in transmission, other details can also decode independently. We only need to request server to resend the lost part of the groups data. At the same time, it can be decoded regional details 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 isn´t interested can be instead by coarse model.