Search

A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied to each single frame in the animation sequence in parallel. The approach that generates the smaller encoded file size is chosen to encode the current frame. Given the same quality requirement, the hybrid coding method can achieve much higher compression ratio than the octree-only method or the delta-only method. The hybrid approach can represent 3D animated sequences with higher compression factors while maintaining reasonable quality. It is easy to implement and have a low cost encoding process and a fast decoding process, which make it a better choice for real time application., {"references":["M. Deering, \"Geometry Compression,\" Proceedings of ACM\nSIGGRAPH'95, pp. 13-20, 1995.","G. Taubin and J. Rossignac, \"Geometric compression through\ntopological surgery,\" ACM Transactions on Graphics, vol. 17, no. 2, pp.\n84-115, 1998.","G. Taubin and J. Rossignac, \"3D Geometry Compression,\" ACM\nSIGGRPAH'98 Course Notes 21, Orlando, Florida, 1998.","C. Touma and C. Gotsman, \"Triangle Mesh Compression.,\" Proceedings\nof 24th Conference on Graphics Interface (GI-98), pp. 26-34, San\nFrancisco, 1998.","J. Rossignac, \"Edgebreaker: Connectivity Compression for Triangle\nMeshes,\" IEEE Transactions on Visualization and Computer Graphics,\nvol. 5, no. 1, pp. 47-61, 1998.","F. Bossen, \"On The Art Of Compressing Three-Dimensional Polygonal\nMeshes And Their Associated Properties,\" Ph.D. Thesis, cole\nPolytechnique Fdrale de Lausanne (EPFL), 1999.","D. Shikhare, \"State of the Art in Geometry Compression,\" National\nCentre for Software Technology, 2000.","D. Luebke, \"A survey of polygonal simplification algorithms,\" Dept.\nComputer Science, University of North Carolina, Chapel Hill, Tech.\nReport TR97-045, 1997.","J. E. Lengyel, \"Compression of Time-Dependent Geometry,\"\nProceedings of ACM Symposium on Interactive 3D Graphics, pp. 89\n-95, New York, ACM Press, 1999.\n[10] M. Alexa and W. M├╝ller, \"Representing Animations by Principal\nComponents,\" Computer Graphics Forum, vol. 19, no. 3, pp. 411-418,\n2000.\n[11] L. Ibarria and J. Rossignac, \"Dynapack:Space-Time Compression of the\n3D animations of triangle meshes with fixed connectivity,\" Proceedings\nof Eurographics/SIGGRAPH Symposium on Computer Animation,\n2003.\n[12] H. M. Brice├▒o, P. V. Sander, L. McMillan, S. Gortler, and H. Hoppe,\n\"Geometry Videos: A new representation for 3D Animations,\"\nProceedings of Eurographics/SIGGRAPH Symposium on Computer\nAnimation(SCA03), San Diego, California, 2003.\n[13] Z. Karni and C. Gotsman, \"Compression of soft-body animation\nsequences,\" Computers & Graphics, vol. 28, pp. 25-34, 2004.\n[14] J. Zhang and C.B. Owen, \"Octree-based Animated Geometry\nCompression\", Computers & Graphics, Volume 31, Issue 3, pp 463-479,\nJune 2007.\n[15] A. Glassner, T. McClure, S. Benza, and M. V. Langeveld, \"Chicken\nCrossing,\" SIGGRAPH Video Review, 1996."]}