Sciweavers

9 search results - page 1 / 2
» Progressive Forest Split Compression
Sort
View
SIGGRAPH
1998
ACM
13 years 8 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
PG
2000
IEEE
13 years 8 months ago
Progressive Geometry Compression for Meshes
A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations us...
Xinguo Liu, Hujun Bao, Qunsheng Peng, Pheng-Ann He...
TOG
2002
127views more  TOG 2002»
13 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 ...
Pierre-Marie Gandoin, Olivier Devillers
3DPVT
2002
IEEE
131views Visualization» more  3DPVT 2002»
13 years 9 months ago
Octree approximation and compression methods
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The ...
Hanan Samet, Andrzej Kochut
ICIP
2005
IEEE
14 years 6 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...