Abstract
A triangulated surface S with V vertices is sometimes stored as a list of T independent triangles, each described by the 3 floating-point coordinates of its vertices. This representation requires about 576V bits and provides no explicit information regarding the adjacency between neighboring triangles or vertices. A variety of boundary-graph data structures may be derived from such a representation in order to make explicit the various adjacency and incidence relations between triangles, edges, and vertices. These relations are stored to accelerate algorithms that visit the surface in a systematic manner and access the neighbors of each vertex or triangle. Instead of these complex data structures, we advocate a simple Corner Table, which explicitly represents the triangle/vertex incidence and the triangle/ triangle adjacency of any manifold or pseudo-manifold triangle mesh, as two tables of integers. The Corner Table requires about 12Vlog2V bits and must be accompanied by a vertex table, which requires 96V bits, if Floats are used. The Corner Table may be derived from the list of independent triangles. For meshes homeomorphic to a sphere, it may be compressed to less that 4V bits by storing the “clers” sequence of triangle-labels from the set {C,L,E,R,S}. Further compression to 3.6V bits may be guaranteed by using context-based codes for the clers symbols. Entropy codes reduce the storage for large meshes to less than 2V bits. Meshes with more complex topologies may require O(log2V) additional bits per handle or hole. We present here a publicly available, simple, state-machine implementation of the Edgebreaker compression, which traverses the corner table, computes the CLERS symbols, and constructs an ordered list of vertex References. Vertices are encoded, in the order in which they appear on the list, as corrective displacements between their predicted and actual locations. Quantizing vertex coordinates to 12 bits and predicting each vertex as a linear combinations of its previously encoded neighbors leads to short displacements, for which entropy codes drop the total vertex location storage for heavily sampled typical meshes below 16V bits.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Gumhold and W. Strasser, “Real Time Compression of Triangle Mesh Connectivity”, Proc. ACM Siggraph, pp. 133–140, July 1998.
M. Isenburg and J. Snoeyink, “Spirale Reversi: Reverse decoding of the Edgebreaker encoding”, Tech. Report TR-99-08, Computer Science, UBC, 1999.
D. King and J. Rossignac, “Guaranteed 3.67V bit encoding of planar triangle graphs”, 11th Canadian Conference on Computational Geometry (CCCG’99), pp. 146–149, Vancouver, CA, August 15–18, 1999.
D. King and J. Rossignac, “Connectivity Compression for Irregular Quadrilateral Meshes” Research Report GIT-GVU-99-29, Dec 1999.
J. Rossignac and D. Cardoze, “Matchmaker: Manifold Breps for nonmanifold r-sets”, Proceedings of the ACM Symposium on Solid Modeling, pp. 31–41, June 1999.
J. Rossignac, “Edgebreaker: Connectivity compression for triangle meshes”, IEEE Transactions on Visualization and Computer Graphics, 5(1), 47–61, Jan–Mar 1999. (Sigma Xi award: Best Paper from Georgia Tech.)
J. Rossignac and A. Szymczak, “Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker”, Computational Geometry, Theory and Applications, 14(1/3), 119–135, November 1999.
A. Szymczak, D. King, J. Rossignac, “An Edgebreaker-based efficient compression scheme for regular meshes”, Proc of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, August 16–19, 2000.
A. Szymczak, D. King, J. Rossignac, “An Edgebreaker-based Efficient Compression Scheme for Connectivity of Regular Meshes”, Journal of Computational Geometry: Theory and Applications, 2000.
G. Taubin and J. Rossignac, “Geometric Compression through Topological Surgery”, ACM Transactions on Graphics, 17(2), 84–115, April 1998. (IBM award: Best Computer Science Paper from IBM.)
C. Touma and C. Gotsman, “Triangle Mesh Compression”, Proceedings Graphics Interface 98, pp. 26–34, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossignac, J., Safonova, A., Szymczak, A. (2003). Edgebreaker on a Corner Table: A Simple Technique for Representing and Compressing Triangulated Surfaces. In: Farin, G., Hamann, B., Hagen, H. (eds) Hierarchical and Geometrical Methods in Scientific Visualization. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55787-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-55787-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62801-6
Online ISBN: 978-3-642-55787-3
eBook Packages: Springer Book Archive