Share Email Print

Proceedings Paper

Progressive compression for triangular meshes with quality control
Author(s): Wenlong Dong; Jiankun Li; C.-C. Jay Kuo
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 28 December 2000
PDF: 12 pages
Proc. SPIE 4115, Applications of Digital Image Processing XXIII, (28 December 2000); doi: 10.1117/12.411543
Show Author Affiliations
Wenlong Dong, Univ. of Southern California (United States)
Jiankun Li, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 4115:
Applications of Digital Image Processing XXIII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?