Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
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
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)
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
Simplification of tetrahedral meshes
Proceedings of the conference on Visualization '98
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
Grow & fold: compression of tetrahedral meshes
Proceedings of the fifth ACM symposium on Solid modeling and applications
Digital Image Compression: Algorithms and Standards
Digital Image Compression: Algorithms and Standards
Constructing Hierarchies for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Progressive lossless compression of arbitrary simplicial complexes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Compressing hexahedral volume meshes
Graphical Models - Special issue on Pacific graphics 2002
Feature Preserving Distance Fields
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
SOT: compact representation for tetrahedral meshes
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
Irregular tetrahedral meshes, which are popular in many engineering and scientific applications, often contain a large number of vertices. A mesh of V vertices and T tetrahedra requires 48·V bits or less to store the vertex coordinates, 4·Vlog2 bits to store the tetrahedra-vertex incidence relations, also called connectivity information, and k·V bits to store the k-bit value samples associated with the vertices. Given that T is 5 to 7 times larger than V and that V often exceeds 323, the storage space required for the connectivity is larger than 300·V bits and thus dominates the overall storage cost. Our “implants spray” compression approach introduced in this paper reduces this cost to about 30·V bits or less — a 10:1 compression ratio. Furthermore, implant spray supports the progressive refinement of a crude model through a series of vertex-splits operations.