ACM Home Page
Please provide us with feedback. Feedback
QSplat compression
Full text PdfPdf (321 KB)
Source Computer graphics, virtual reality, visualisation and interaction in Africa archive
Proceedings of the 3rd international conference on Computer graphics, virtual reality, visualisation and interaction in Africa table of contents
Stellenbosch, South Africa
SESSION: Modelling and representing surfaces table of contents
Pages: 15 - 24  
Year of Publication: 2004
ISBN:1-58113-863-6
Authors
Rachid Namane  ParlMéd Team, LRPE, Bab-Ezzouar Algiers, Algeria
Fatima O. Boumghar  ParlMéd Team, LRPE, Bab-Ezzouar Algiers, Algeria
Kadi Bouatouch  IRISA, Campus de Beaulieu, France
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1029949.1029952
What is a DOI?

ABSTRACT

The great advances in the field of 3D scanning technologies have enabled the creation of meshes with hundred millions of polygons. Rendering data sets of that size is time consuming even with commodity graphics hardware. The QSplat technique that has been introduced by S. Rusinkiewics and M. Levoy of Stanford University is used for the inter-active point based visualization of large 3D scenes. Nevertheless, it has some drawbacks like the storage requirement which is still higher. The objective of our work we present in this paper is to improve the per-node storage requirements of QSplat models and to minimize the transmission cost in streaming QSplat models across low-bandwidth networks or bottlenecked networks. To do that, we focus on coding strategies which provide reasonable data reduction at low decoding complexity. In this context, Huffman and relative delta encoding fit well with our purposes. The performances of the compression process are studied and the rendering algorithm is extended in order to be able to work on compressed data without loosing the original system interactivity.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. Alliez and C. Gotsman. Recent advances in compression of 3d meshes. In Proceedings of the Symposium on Multiresolution in Geometric Modeling Cambridge, September 2003.
 
2
3
 
4
J. Grossman and W. Dally. Point sample rendering. In Proc. Eurographics Rendering Workshop, 1998.
 
5
D. Huffman. A method for the construction of minimum redundency codes. Proc. IERE, 40(9):198--111, Sept 1952.
 
6
 
7
M. Levoy and T. Whitted. The use of points as a display primitive. Technical report, TR 85-022, University of North Carolina at Chapel Hill, 1985.
 
8
R. Pajarola and J. Rossignac. Compressed progressive meshes. Technical report, GIT-GVU-99-05, Georgia Institute of Technology, 1999.
 
9
 
10
11
12
13
14
 
15
 
16
17

Collaborative Colleagues:
Rachid Namane: colleagues
Fatima O. Boumghar: colleagues
Kadi Bouatouch: colleagues