loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Symposium on 3D Data Processing Visualization and Transmission (3DPVT'02)
Concentric Strips: Algorithms and Architecture for the Compression/Decompression of Triangle Meshes
Padova, Italy
June 19-June 21
ISBN: 0-7695-1521-5
P. N. Mallón, University of Santiago de Compostela
M. Bóo, University of Santiago de Compostela
M. Amor, University of A Coruña
J. D. Bruguera, University of Santiago de Compostela

The complexity of triangle meshes is growing rapidly due to the need for higher accuracy. As a consequence, the network transmission delay of 3D graphics data is the major bottleneck in computer graphics. An interesting solution to this limited bandwidth is the compression technique. This solution implies the necessity of specific hardware to reconstruct the mesh at the entrance of the graphics pipeline.

In this work we present a new compression connectivity algorithm or triangle meshes. This is a simple algorithm which improves the compression ratio (nearly 1.5 bits/triangle) by previously reported schemes. Due to its simplicity, it is very suitable for hardware implementation. This implementation has a simple and efficient structure, low storage requirements and a reconstruction rate of one triangle per cycle.

Citation:
P. N. Mallón, M. Bóo, M. Amor, J. D. Bruguera, "Concentric Strips: Algorithms and Architecture for the Compression/Decompression of Triangle Meshes," 3dpvt, pp.380, First International Symposium on 3D Data Processing Visualization and Transmission (3DPVT'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.