SMI 2012: Full Progressive compression of manifold polygon meshes
Computers and Graphics
Streaming compressed 3D data on the web using JavaScript and WebGL
Proceedings of the 18th International Conference on 3D Web Technology
Joint watermarking and progressive geometric compression of 3D meshes
Proceedings of the first ACM workshop on Information hiding and multimedia security
Triangle mesh compression along the Hamiltonian cycle
The Visual Computer: International Journal of Computer Graphics
SMI 2013: POMAR: Compression of progressive oriented meshes accessible randomly
Computers and Graphics
| Hi-index | 0.00 |
We propose a new lossless progressive compression algorithm based on rate-distortion optimization for meshes with color attributes; the quantization precision of both the geometry and the color information is adapted to each intermediate mesh during the encoding/decoding process. This quantization precision can either be optimally determined with the use of a mesh distortion measure or quasi-optimally decided based on an analysis of the mesh complexity in order to reduce the calculation time. Furthermore, we propose a new metric which estimates the geometry and color importance of each vertex during the simplification in order to faithfully preserve the feature elements. Experimental results show that our method outperforms the state-of-the-art algorithm for colored meshes and competes with the most efficient algorithms for non-colored meshes.