The Research Of A Progressive 3D Geometry Compression Algorithm

Recently computer graphics plays increasingly important roles in many fields including science, engineering, designing, manufacturing, medicine, simulation, environment protection, training, art and entertainment etc. In these applications, the three dimensional geometry data are widely used for various purposes.On the one hand, the three dimensional geometry data are required to inspect and manipulate in real time at local/remote place for many applications, in order to enhance the human productivity and satisfaction. On the other hand, the number and the complexity of the three dimensional geometry data sets are growing rapidly, to meet the need of accurate precision and complicated details. Consequently, a new geometry coding scheme, 3D mesh compression, is proposed to solve the bottlenecks in the mesh storage, process, transmission and render. 3D mesh compression, first proposed by Deering, is a compact data representation with the following properties, such as fewer data quantity with compressed format, faster rendering speed, and better applicability to the transmission. To deal with the difficulties of large data storage and. scheduler between main memory and disk, the former works concentrate on the single-rate approach, which treats the attributes (e.g. connectivity and geometry) as a whole. While the recent researches mainly simplify the input mesh into levels of detail and progressively transmit them. The advantage of progressive compression is that user can achieve an approximate mesh even if a few bits have been received.Firstly, all algorithms, which compress 3D meshes efficiently, have been examinedand classified into single-rate compress and progressive transmission type. In brief,main ideas behind each class were described, and the advantages and shortcomings of the algorithms in each class were compared.Secondly, a new progressive compression for lossless transmission of triangle meshes is proposed, which employs edge-collapse operator, based on edge length criterion, to simplify the original mesh. The experiments have thrown that the proposed algorithm can achieve a better coding efficiency, and have a linear time complexity to fast process the meshes.At last, a conclusion is made, and some research points are foresee..