Connectivity compression for stripified triangle meshes

  • Authors:
  • Hao Huang;Fan Zhou

  • Affiliations:
  • Computer Application Institute, Sun Yat-sen University, Guangzhou, China;Computer Application Institute, Sun Yat-sen University, Guangzhou, China

  • Venue:
  • Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern graphics application systems have to render many 3D triangle mesh models, thereby facing problems of memory and bandwidth. A general significant solution is to compress the static 3D triangle mesh model at the preprocessing phase, especially the topological information. This paper presents a new triangle meshes compression algorithm, which encodes connectivity information between vertex chains in the meshes that are already stripified. The proposed algorithm provides a new representation that is guaranteed to encode any stripified meshes in less than 1.67 bits/T, and 1.05 bits/T on average. Furthermore, the proposed algorithm employs a short compression/decompression time. Hence it will satisfy real-time rendering constraints.