Connectivity Compression for Stripified Triangle Meshes Using Basic Strips
Hao Huang, Fan Zhou · 2007
This paper presents a new triangle meshes compression algorithm, which encodes connectivity information between vertex chains in the meshes that are already stripified. The algorithm builds up basic strips based on the vertex chains of the original strips at first. The information of redundant edges is implicit hence the only information need to encode is about absent edges. The proposed algorithm provides a new representation that is guaranteed to encode connectivity information of any meshes in less than 2 bits/T, and in 1.2 bits/T on average in the experiment results using FTSG. In the experiments, the method was proved to have good performance.