We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the reduction of error in a compression setting. Using semi-regular meshes, parameter and connectivity information can be virtually eliminated. Coupled with semi-regular wavelet transforms, zerotree coding, and subdivision based reconstruction we see improvements in error by a factor four (12dB) compared to other progressive coding schemes.
The progressive coding scheme introduced by Khodakovsky et al. REF uses wavelet transform, zerotree coding and subdivision-based reconstruction to improve the compression ratio.
Progressive geometry compression
SIGGRAPH '00
Computer Science