Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Topological considerations in isosurface generation
ACM Transactions on Graphics (TOG)
Arithmetic coding for data compression
Communications of the ACM
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A comparison of normal estimation schemes
VIS '97 Proceedings of the 8th conference on Visualization '97
Data compression: the complete reference
Data compression: the complete reference
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
Face fixer: compressing polygon meshes with properties
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
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Semi-regular mesh extraction from volumes
Proceedings of the conference on Visualization '00
Scalable isosurface visualization of massive datasets on COTS clusters
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
MICCAI '98 Proceedings of the First International Conference on Medical Image Computing and Computer-Assisted Intervention
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
Efficient Coding of Non-Triangular Mesh Connectivity
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
A JBIG-ABIC compression engine for digital document processing
IBM Journal of Research and Development
IBM Journal of Research and Development
Space-efficient boundary representation of volumetric objects
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Guest Editorial: Computational Vision at Brown
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Progressive encoding of complex isosurfaces
ACM SIGGRAPH 2003 Papers
Out-of-core and compressed level set methods
ACM Transactions on Graphics (TOG)
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Adaptive vertex chasing for the lossless geometry coding of 3d meshes
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part I
| Hi-index | 0.00 |
In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume grids, and used to generate polygon meshes or alternative representations. In this algorithm the mesh connectivity and a substantial proportion of the geometric information are encoded to a fraction of a bit per Marching Cubes vertex with a context based arithmetic coder closely related to the JBIG binary image compression standard. The remaining optional geometric information that specifies the location of each Marching Cubes vertex more precisely along its supporting intersecting grid edge, is efficiently encoded in scan-order with the same mechanism. Vertex normals can optionally be computed as normalized gradient vectors by the encoder and included in the bitstream after quantization and entropy encoding, or computed by the decoder in a postprocessing smoothing step. These choices are determined by trade-offs associated with an in-core vs. out-of-core decoder structure. The main features of our algorithm are its extreme simplicity and high compression rates