28 December 2000 Progressive compression for triangular meshes with quality control
Author Affiliations +
In this paper we present a mesh compression algorithm based on a layered mesh simplification method which allows a multiresolution representation for triangular meshes. Unlike previous progressive compression methods which use the greedy vertex removal scheme to achieve the best compression results, we adopt a new layered mesh simplification algorithm to generate a sequence of meshes at a broad range of resolutions with very good visual quality through a derived threshold bounding curve. In order to achieve the desirable coding gain, we perform two types of prediction for geometric data a well as topological data. The advantage of the proposed algorithm is that it generates progressive meshes of linear resolutions, i.e. we can smoothly move from meshes of lower resolutions to higher ones by linearly adding geometry primitives. It can deal well with general meshes containing special topological features such as boundary edges.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wenlong Dong, Wenlong Dong, Jiankun Li, Jiankun Li, C.-C. Jay Kuo, C.-C. Jay Kuo, } "Progressive compression for triangular meshes with quality control", Proc. SPIE 4115, Applications of Digital Image Processing XXIII, (28 December 2000); doi: 10.1117/12.411543; https://doi.org/10.1117/12.411543


Tests of a 3D visual-search model observer for SPECT
Proceedings of SPIE (March 28 2013)
View-dependent progressive mesh coding based on partitioning
Proceedings of SPIE (January 04 2002)
Watermarking in JPEG bitstream
Proceedings of SPIE (March 21 2005)
Wavelet-based image compression and content authentication
Proceedings of SPIE (September 26 2001)

Back to Top