Sciweavers

Share
TOG
2002

Progressive lossless compression of arbitrary simplicial complexes

8 years 4 months ago
Progressive lossless compression of arbitrary simplicial complexes
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 manifold 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 [Devillers and Gandoin 2000] which does not depend on the connectivity. Then we compute a compatible sequence of meshes which can be encoded using edge expansion [Hoppe et al. 1993] and vertex split [Popovi
Pierre-Marie Gandoin, Olivier Devillers
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TOG
Authors Pierre-Marie Gandoin, Olivier Devillers
Comments (0)
books