Copyright [©] (1998) by Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distrubuted for profit or commericial advantage. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
In this paper we introduce a new compressed representation for polyhedral models and associated compression and decompression algorithms. Such a compressed representation significantly reduces the time required to transmit the model over digital communication channels, and the amount of space required to store the model. In our compression scheme a triangulated polyhedron is represented by two interlocked trees, a spanning trees of vertices, and a spanning tree of triangles. The connectivity information represented in other compact schemes, such as triangular strips or generalized triangular meshes, can be efficiently derived from our representation. The algorithms described in the paper compress connectivity information to an average of roughly two bits per triangle. A variable length lossy compression technique is used for vertex positions, normals, colors, and texture mappings.
By: Gabriel Taubin and Jarek Rossignac
Published in: ACM Transactions on Graphics, volume 17, (no 4), pages 84-115 in 1998
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .