Vector quantization and signal compression
Vector quantization and signal compression
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Unsolved problems and opportunities for high-quality, high-performance 3D graphics on a PC platform
HWWS '98 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Optimization of mesh locality for transparent vertex caching
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Progressive compression of arbitrary triangular meshes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
Single Resolution Compression of Arbitrary Triangular Meshes with Properties
DCC '99 Proceedings of the Conference on Data Compression
IEEE Transactions on Information Theory
Error-resilient pyramid vector quantization for image compression
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
On the modeling of DCT and subband image data for compression
IEEE Transactions on Image Processing
High-pass quantization for mesh encoding
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometry compression of normal meshes using rate-distortion algorithms
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometry-Aware Bases for Shape Approximation
IEEE Transactions on Visualization and Computer Graphics
Algebraic analysis of high-pass quantization
ACM Transactions on Graphics (TOG)
Journal of Visual Communication and Image Representation
High Capacity Reversible Data Hiding for 3D Meshes in the PVQ Domain
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Unsupervised learning applied to progressive compression of time-dependent geometry
Computers and Graphics
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Compression of point-based 3D models by shape-adaptive wavelet coding of multi-height fields
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
| Hi-index | 0.00 |
Rendering geometrically detailed 3D models requires the transfer and processing of large amounts of triangle and vertex geometry data. Compressing the geometry bitstream can reduce bandwidth requirements and alleviate transmission bottlenecks. In this paper, we show vector quantization to be an effective compression technique for triangle mesh vertex data. We present predictive vector quantization methods using unstructured codebooks as well as a product code pyramid vector quantizer. The technique is compatible with most existing mesh connectivity encoding schemes and does not require the use of entropy coding. In addition to compression, our vector quantization scheme can be used for complexity reduction by accelerating the computation of linear vertex transformations. Consequently, an encoded set of vertices can be both decoded and transformed in approximately 60 percent of the time required by a conventional method without compression.