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
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Progressive forest split compression
Proceedings of the 25th 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
Optimal bit allocation in compressed 3D models
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive compression for lossless transmission of triangle meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Progressive lossless compression of arbitrary simplicial complexes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Efficient compression and rendering of multi-resolution meshes
Proceedings of the conference on Visualization '02
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
Wavelet-Based Progressive Compression Scheme for Triangle Meshes: Wavemesh
IEEE Transactions on Visualization and Computer Graphics
ACM SIGGRAPH 2004 Papers
Surface compression with geometric bandelets
ACM SIGGRAPH 2005 Papers
Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
ACM SIGGRAPH 2005 Papers
Optimal Coding and Sampling of Triangulations
Algorithmica
Mesh connectivity compression using convection reconstruction
Proceedings of the 2007 ACM symposium on Solid and physical modeling
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
An efficient bit allocation for compressing normal meshes with an error-driven quantization
Computer Aided Geometric Design - Special issue: Geometry processing
Lossless compression of predicted floating-point geometry
Computer-Aided Design
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
SMI 2012: Full Progressive compression of manifold polygon meshes
Computers and Graphics
Streaming compressed 3D data on the web using JavaScript and WebGL
Proceedings of the 18th International Conference on 3D Web Technology
Triangle mesh compression along the Hamiltonian cycle
The Visual Computer: International Journal of Computer Graphics
SMI 2013: POMAR: Compression of progressive oriented meshes accessible randomly
Computers and Graphics
Hi-index | 0.00 |
In this paper, we propose a novel progressive lossless mesh compression algorithm based on Incremental Parametric Refinement, where the connectivity is uncontrolled in a first step, yielding visually pleasing meshes at each resolution level while saving connectivity information compared to previous approaches. The algorithm starts with a coarse version of the original mesh, which is further refined by means of a novel refinement scheme. The mesh refinement is driven by a geometric criterion, in spirit with surface reconstruction algorithms, aiming at generating uniform meshes. The vertices coordinates are also quantized and transmitted in a progressive way, following a geometric criterion, efficiently allocating the bit budget. With this assumption, the generated intermediate meshes tend to exhibit a uniform sampling. The potential discrepancy between the resulting connectivity and the original one is corrected at the end of the algorithm. We provide a proof-of-concept implementation, yielding very competitive results compared to previous works in terms of rate/distortion trade-off.