Progressive Lossless Compression of Arbitrary Simplicial Complexes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Graphics Year : 2002

Progressive Lossless Compression of Arbitrary Simplicial Complexes

Pierre-Marie Gandoin
Olivier Devillers


Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are ``manifol'' or ``nearly manifold''. We propose here a progressive geometry compression scheme which can handle manifold models as well as ``triangle soups'' and 3D tetrahedral meshes. The method is lossless when the decompression is complete which is extremely important in some domains such as medical or finite element. While most existing methods enumerate the vertices of the mesh in an order depending on the connectivity, we use a kd-tree technique which does not depend on the connectivity. Then we compute a compatible sequence of meshes which can be encoded using edge expansion and vertex split. The main contributions of this paper are: the idea of using the kd-tree encoding of the geometry to drive the construction of a sequence of meshes, an improved coding of the edge expansion and vertex split since the vertices to split are implicitly defined, a prediction scheme which reduces the code for simplices incident to the split vertex, and a new generalization of the edge expansion operation to tetrahedral meshes.
Fichier principal
Vignette du fichier
hal.pdf (7.33 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00167216 , version 1 (16-08-2007)



Pierre-Marie Gandoin, Olivier Devillers. Progressive Lossless Compression of Arbitrary Simplicial Complexes. ACM Transactions on Graphics, 2002, 21 (Siggraph'2002 Conference proceedings), pp.372-379. ⟨10.1145/566654.566591⟩. ⟨inria-00167216⟩
141 View
564 Download



Gmail Facebook Twitter LinkedIn More