Space-Time Surface Simplification and Edgebreaker Compression for 2D Cel Animations

Digitized cel animations are typically composed of frames that contain a small number of regions; each region contains pixels of the same color and exhibits a significant level of shape coherence through time. To exploit this coherence, we treat the stack of frames as a 3D volume and represent the evolution of each region by the bounding surface of the 3D sub-volume V that it sweeps out. To reduce transmission costs, we triangulate and simplify the bounding surface and then encode it using the Edgebreaker compression scheme. To restore a close approximation of the original animation, the client player decompresses the surface and produces the successive frames by intersecting V with constant-time planes. The intersection is generated in real-time with standard graphics hardware through an improved capping (i.e. solid clipping) technique, which correctly handles overlapping facets. We have tested this approach on real and synthetic black&white animations and report compression ratios that improve upon those produced using the MPEG, MRLE, and GZIP compression standards for an equivalent quality result.

[1]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[2]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[3]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

[4]  Jarek Rossignac,et al.  Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker , 1999, Comput. Geom..

[5]  Jarek Rossignac,et al.  An Edgebreaker-Based Efficient Compression Scheme for Connectivity of Regular Meshes , 2000, CCCG.

[6]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998 .

[7]  Jarek Rossignac,et al.  Interactive inspection of solids: cross-sections and interferences , 1992, SIGGRAPH.

[8]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.

[9]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .

[10]  Jarek Rossignac,et al.  Guaranteed 3.67v bit encoding of planar triangle graphs , 1999, CCCG.

[11]  Jarek Rossignac,et al.  An Edgebreaker-based efficient compression scheme for regular meshes , 2001, Comput. Geom..

[12]  Solomon W. Golomb,et al.  Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[13]  A. Safonova,et al.  3D Compression Made Simple: Edgebreaker on a Corner-Table , 2001 .

[14]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[15]  Didier J. Le Gall,et al.  The MPEG video compression algorithm , 1992, Signal Process. Image Commun..

[16]  David Salomon,et al.  Data Compression: The Complete Reference , 2006 .

[17]  Robert A. Hummel,et al.  Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition , 1995, IEEE Trans. Vis. Comput. Graph..

[18]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[19]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[20]  Marco Attene,et al.  Re-meshing techniques for topological analysis , 2001, Proceedings International Conference on Shape Modeling and Applications.

[21]  S. Golomb Run-length encodings. , 1966 .

[22]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[23]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[24]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[25]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[26]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.