Progressive compression of arbitrary triangular meshes

Daniel Cohen-Or*, David Levin, Offir Remez

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

138 Scopus citations


In this paper we present a mesh compression method based on a multiresolution decomposition whose detail coefficients have a compact representation and thus smaller entropy than the original mesh. Given an arbitrary triangular mesh with an irregular connectivity, we use a hierarchical simplification scheme, which generates a multiresolution model. By reversing the process we define a hierarchical progressive refinement process, where a simple prediction plus a correction is used for inserting vertices to form a finer level. We show how the connectivity of an arbitrary triangulation can be encoded efficiently by a coloring technique, and recovered incrementally during the progressive reconstruction of the original mesh.

Original languageEnglish
Number of pages6
StatePublished - 1999
EventProceedings of the IEEE Visualization '99 - San Francisco, CA, USA
Duration: 24 Oct 199929 Oct 1999


ConferenceProceedings of the IEEE Visualization '99
CitySan Francisco, CA, USA


Dive into the research topics of 'Progressive compression of arbitrary triangular meshes'. Together they form a unique fingerprint.

Cite this