SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Interactive multiresolution surface viewing
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Multiresolution analysis for surfaces of arbitrary topological type
ACM Transactions on Graphics (TOG)
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
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
On the definition and the construction of pockets in macromolecules
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Tetrahedral mesh compression with the cut-border machine
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
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
Geometric compression for interactive transmission
Proceedings of the conference on Visualization '00
Progressive lossless compression of arbitrary simplicial complexes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures
IEEE Transactions on Visualization and Computer Graphics
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Piecewise regular meshes: construction and compression
Graphical Models - Special issue: Processing on large polygonal meshes
An Improved TIN Compression Using Delaunay Triangulation
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
SwingWrapper: Retiling triangle meshes for better edgebreaker compression
ACM Transactions on Graphics (TOG)
Delphi: geometry-based connectivity prediction in triangle mesh compression
The Visual Computer: International Journal of Computer Graphics
Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
ACM SIGGRAPH 2005 Papers
An Efficient Connectivity Compression for Triangular Meshes
Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science
GEncode: Geometry-Driven Compression in Arbitrary Dimension and Co-Dimension
SIBGRAPI '05 Proceedings of the XVIII Brazilian Symposium on Computer Graphics and Image Processing
Streaming compression of triangle meshes
SIGGRAPH '05 ACM SIGGRAPH 2005 Sketches
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Progressive lossless mesh compression via incremental parametric refinement
SGP '09 Proceedings of the Symposium on Geometry Processing
Hi-index | 0.00 |
During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first brings improvement over current state of the art bitrates, and secondly, does not constraint the coding of the vertex positions, offering therefore a good complementarity with the best performing geometric compression methods. The initial observation having motivated this work is that very often, most of the connectivity part of a mesh can be automatically deduced from its geometric part using reconstruction algorithms. This has already been used within the limited framework of projectable objects (essentially terrain models and GIS), but finds here its first generalization to arbitrary triangular meshes, without any limitation regarding the topological genus, the number of connected components, the manifoldness or the regularity. This can be obtained by constraining and guiding a Delaunay-based reconstruction algorithm so that it outputs the initial mesh to be coded. The resulting rates seem extremely competitive when the meshes are fully included in Delaunay, and are still good compared to the state of the art in the general case.