Algorithms and Hardware for Data Compression in Point Rendering Applications

The high storage requirements associated with point rendering applications make the utilization of data compression techniques interesting. Point rendering has been proposed only recently and, consequently, no compression strategies have yet been developed. In this paper we present compression algorithms for two specific data distributions widely used in point rendering: a naive distribution with no specific sorting of the points and a layer distribution which is suitable for incremental algorithms. In this last case points are sorted in layers and the connectivity among them is encoded. The algorithms we propose have a high compression rate (5.0 bits/point for the naive distribution and 7.7 bits/point for the layer distribution). Additionally we present the hardware implementation for the decompression of both algorithms. Both algorithms are implemented in a single hardware unit providing a control to select between them.

[1]  Matthias Zwicker,et al.  Object Space EWA Surface Splatting: A Hardware Accelerated Approach to High Quality Point Rendering , 2002, Comput. Graph. Forum.

[2]  Markus H. Gross,et al.  Point-based computer graphics , 2004, SIGGRAPH '04.

[3]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[4]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[5]  William J. Dally,et al.  Point Sample Rendering , 1998, Rendering Techniques.

[6]  Marc Alexa,et al.  Point-based computer graphics , 2004, SIGGRAPH '04.

[7]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[8]  Matthias Zwicker,et al.  Surfels: surface elements as rendering primitives , 2000, SIGGRAPH.

[9]  Friedhelm Meyer auf der Heide,et al.  The randomized z-buffer algorithm: interactive rendering of highly complex scenes , 2001, SIGGRAPH.

[10]  Javier D. Bruguera,et al.  Concentric strips: algorithms and architecture for the compression/decompression of triangle meshes , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

[11]  Matthias Zwicker,et al.  Surface splatting , 2001, SIGGRAPH.

[12]  Wolfgang Straßer,et al.  Tetrahedral mesh compression with the cut-border machine , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[13]  Wolfgang Straßer,et al.  A new algorithm for high-speed projection in point rendering applications , 2003, Euromicro Symposium on Digital System Design, 2003. Proceedings..

[14]  Jarek Rossignac,et al.  Grow & fold: compression of tetrahedral meshes , 1999, SMA '99.