Published in

Association for Computing Machinery (ACM), ACM Transactions on Graphics, 4(22), p. 982-996, 2003

DOI: 10.1145/944020.944022

Links

Tools

Export citation

Search in Google Scholar

SwingWrapper

Journal article published in 2003 by Marco Attene, Bianca Falcidieno, Michela Spagnuolo ORCID, Jarek Rossignac
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We focus on the lossy compression of manifold triangle meshes. Our SwingWrapper approach partitions the surface of an original mesh M into simply connected regions, called triangloids . From these, we generate a new mesh M . Each triangle of M is an approximation of a triangloid of M . By construction, the connectivity of M is fairly regular and can be compressed to less than a bit per triangle using EdgeBreaker or one of the other recently developed schemes. The locations of the vertices of M are compactly encoded with our new prediction technique, which uses a single correction parameter per vertex. SwingWrapper strives to reach a user-defined output file size rather than to guarantee a given error bound. For a variety of popular models, a rate of 0.4 bits/triangle yields an L 2 distortion of about 0.01% of the bounding box diagonal. The proposed solution may also be used to encode crude meshes for adaptive transmission or for controlling subdivision surfaces.