Share Email Print
cover

Proceedings Paper

Progressive geometry coding of 3D meshes using hierarchical vertex set split
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A progressive lossless 3D geometry encoder using a hierarchical vertex set split method is presented in this work. Compared with prior art, the proposed coder has significantly better rate-distortion (R-D) performance at low bit-rates and provides visually pleasant intermediate meshes at all bit-rates. Given a 3D mesh, all its 3D vertices form an initial vertex set, which is split into several child vertex sets using the well-known Generalized Lloyd Algorithm (GLA). Each newly generated vertex set that contains more than one vertex is iteratively split so as to form a hierarchical structure. During the process of hierarchical vertex set split, a representative is calculated for each newly generated vertex set. Then, the representatives of all existing vertex sets form an approximation to the original 3D geometry. For each vertex set split, the number of child vertex sets is arithmetic encoded, and the offsets of the child representatives from their parent representative are sorted, quantized and arithmetic encoded. If a finer resolution is required for a vertex set containing only one vertex, the rectangloid cell containing that vertex can be further subdivided and coded iteratively. Experimental results are provided to demonstrate the superior performance of the proposed geometry coder.

Paper Details

Date Published: 16 September 2005
PDF: 9 pages
Proc. SPIE 5909, Applications of Digital Image Processing XXVIII, 590912 (16 September 2005); doi: 10.1117/12.613076
Show Author Affiliations
Jingliang Peng, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)


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

© SPIE. Terms of Use
Back to Top