A Meshless Compression Algorithm For Mesh Surfaces

Three-dimensional (3D) meshes, As one of the representation of 3D objects, have been widely used in computer graphics. They often require a huge amount of data for storage and transmission in the raw data format. To solve the problem, Many algorithms have been proposed to compress 3D meshes recently. Most of these methods concentrate on the compression of connectivity or geometry data. Also some methods compress connectivity and geometry data both. But most of these algorithms can handle only manifold meshes with additional constraints.This dissertation proposes a new mesh compression method by constructing the square surfel representation. First we get the square surfel representation to replace triangular mesh, Then encode the square surfel with octree linear code. With this encoding, which doesn't need to encode the connectivity information, we can reduce the data to about 10%~20% of original data. And this algorithm can encode any 3D meshes with arbitrary topological structure progressively. This presentation is divided into four chapters.In the first chapter, Introduce the background and main methods of the mesh compression, and tell the theory of these algorithms , at last give a brief introduction of our work.The second chapter, we do the work of changing original model to Square face surfel representation ,this work mainly have two phase, first we decompose the space with octree ,and get the voxelization of model ,then we find all the skin faces of the voxels , finally we use this representation to approximate the original model.The third chapter, encode and decode the square surfels, and reconstruct triangular mesh ,at last smooth this triangular mesh . in this part we demonstrate the efficiency of this compression method .The fourth chapter, the main results are proposed and the main points in future...