Progressive compression of manifold polygon meshes

This paper presents a new algorithm for the progressive compression of manifold polygon meshes. The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines vertex removal and local remeshing. The mesh conn...

Full description

Saved in:
Bibliographic Details
Published in:Computers & graphics Vol. 36; no. 5; pp. 349 - 359
Main Authors: Maglo, Adrien, Courbet, Clément, Alliez, Pierre, Hudelot, Céline
Format: Journal Article
Language:English
Published: Elsevier Ltd 01-08-2012
Elsevier
Series:Shape Modeling International (SMI) Conference 2012
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a new algorithm for the progressive compression of manifold polygon meshes. The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines vertex removal and local remeshing. The mesh connectivity is encoded by two lists of Boolean error predictions based on the mesh geometry: one for the inserted edges and the other for the faces with a removed center vertex. The mesh geometry is encoded with a barycentric error prediction of the removed vertex coordinates and a local curvature prediction. We also include two methods that improve the rate-distortion performance: a wavelet formulation with a lifting scheme and an adaptive quantization technique. Experimental results demonstrate the effectiveness of our approach in terms of compression rates and rate-distortion performance. [Display omitted] ► We present a new progressive mesh compression algorithm. ► The approach handles efficiently any manifold mesh with arbitrary face degrees. ► Improvements are proposed to increase the performance of the algorithm. ► Experiments show the effectiveness of the approach.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0097-8493
1873-7684
DOI:10.1016/j.cag.2012.03.023