SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Edgebreaker: a simple compression for surfaces with handles
Proceedings of the seventh ACM symposium on Solid modeling and applications
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Dynapack: space-time compression of the 3D animations of triangle meshes with fixed connectivity
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
A scalable data structure for three-dimensional non-manifold objects
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
IEEE Transactions on Visualization and Computer Graphics
A pattern-based data structure for manipulating meshes with regular regions
GI '05 Proceedings of Graphics Interface 2005
Data structures for simplicial complexes: an analysis and a comparison
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
3D Animation Compression Using Affine Transformation Matrix and Principal Component Analysis
IEICE - Transactions on Information and Systems
Single-rate near lossless compression of animated geometry
Computer-Aided Design
Computer Aided Geometric Design
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
SMI 2012: Full Curvature-based offset distance: Implementations and applications
Computers and Graphics
Zipper: A compact connectivity data structure for triangle meshes
Computer-Aided Design
Proceedings of the 18th International Conference on 3D Web Technology
Finite Element/Fictitious Domain programming for flows with particles made simple
Advances in Engineering Software
| Hi-index | 0.00 |
Edgebreaker is a simple technique for compressing three-dimensional triangle meshes. We introduce here a new formulation of Edgebreaker, which leads to a very simple implementation. We describe it in terms of a simple data structure, which we call the Corner Table. It represents the connectivity of any manifold mesh as two tables, V and O, such that for a corner c, which is the association of a triangle with a vertex, V[c] is an integer reference to the vertex of c and O[c] is an integer reference to the opposite corner. For meshes that are homeomorphic to a sphere, Edgebreaker encodes these two tables with less than 2 bits per triangle. It compresses vertex locations using Touma and Gottsman's parallelogram predictor. We also present a new decompression, inspired by the Wrap&Zip decompression technique developed in collaboration with Andrzej Szymczak. We call it Zip&Wrap, because it works in the inverse direction from Wrap&Zip and zips cracks in the reconstructed mesh sooner. The detailed source code for the compression and the decompression algorithms fits on a single page. A further improvement of the codebook of Edgebreaker, developed with Davis King, guarantees no more than 1.73 bits per triangle for the connectivity. Entropy encoding reduces this cost in practice to less than a bit per triangle when the mesh is large. Through minor modifications, the Edgebreaker algorithm has been adapted to manifold meshes with holes and handles, to non-triangle meshes, and to non-manifold meshes. A Corner-Table implementation of these will be described elsewhere.