In this paper, we propose an efficient compression algorithm for 3D triangular mesh, which is composed of connectivity data and geometry data. First, the vertex degree warping method is proposed to compress the connectivity data losslessly. While the connectivity data and the geometry data are encoded independently in most conventional algorithms, the geometrical information is exploited to efficiently compress the connectivity data in the proposed approach. Second, the dual parallelogram prediction technique is proposed as an effective geometry prediction scheme. By adopting the triangle fan structure, the proposed algorithm provides smaller prediction error than the conventional algorithm. Simulation results for various 3D mesh models demonstrate that the proposed algorithm yields higher compression ratio than the conventional algorithm.
|Journal||Proceedings - IEEE International Symposium on Circuits and Systems|
|Publication status||Published - 2002|
|Event||2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States|
Duration: 2002 May 26 → 2002 May 29
ASJC Scopus subject areas
- Electrical and Electronic Engineering