skip to main content
10.1145/1185448.1185461acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
Article

Optimizing octree motion representation for 3D animation

Published: 10 March 2006 Publication History

Abstract

Geometry compression is the coding of 3D geometric data in a form that requires less space to store and less bandwidth to transmit. Animated geometry compression is the compression of temporal sequences of geometric data. An octree-based motion representation method in which a small set of motion vectors are generated for each frame by analyzing the motion between consecutive frames was proposed in a previous research. The goal of this paper is to optimize the octree-based animated geometry compression algorithm by storing the motion vectors at non-leaf nodes in contrast to the original method where motion vectors are stored only in leaf nodes. Some leaf nodes do not need to store the motion vectors by inheriting their parents' motion vectors. This method especially benefits the animation where most regions have simple movement and small area has complicated movements. The proposed technique will always perform better than the original method. In some cases, it may have much better compression ratio than the original method. This new approach is easy to implement on top of original octree-based algorithm and has faster encoding and decoding speed.

References

[1]
M. Alexa and W. Müller, Representing Animations by Principal Components. Computer Graphics Forum, vol. 19, pp. 411--418, 2000.
[2]
C. L. Bajaj, V. Pascucci, and G. Zhuang, Progressive compression and transmission of Arbitrary triangle meshes. In Proceedings of IEEE Visualization '99, 1999.
[3]
F. Bossen, On The Art Of Compressing Three-Dimensional Polygonal Meshes And Their Associated Properties: cole Polytechnique Fdrale de Lausanne (EPFL), 1999.
[4]
H. M. Briceño, P. V. Sander, L. McMillan, S. Gortler, and H. Hoppe, Geometry Videos: A new representation for 3D Animations. In Proceedings of Eurographics/SIGGRAPH Symposium on Computer Animation(SCA03), San Diego, California, 2003.
[5]
D. Cohen-Or, D. Levin, and O. Remez, Progressive compression of arbitrary triangular meshes. In Proceedings of IEEE Visualization'99, Los Alamitos, California, 1999.
[6]
M. Deering, Geometry Compression. In Proceedings of ACM SIGGRAPH 95, 1995.
[7]
N. Foster and R. Fedkiw, Practical Animation of Liquids. In Proceedings of ACM SIGGRAPH 01, 2001.
[8]
N. Foster and D. Metaxas, Modeling Water for Computer Animation. Communications of the ACM, vol. 43, pp. 60--67, 2000.
[9]
A. Fournier and D. Y. Montuno, Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics, vol. 3, pp. 153--174, 1984.
[10]
P.-M. Gandoin and O. Devillers, Progressive lossless compression of arbitrary simplicial complexes. In Proceedings of ACM SIGGRAPH 2002, Texas, 2002.
[11]
H. Hoppe, Progressive meshes. In Proceedings of ACM SIGGRAPH 96, New Orleans, Louisiana, 1996.
[12]
L. Ibarria and J. Rossignac, Dynapack:Space-Time Compression of the 3D animations of triangle meshes with fixed connectivity. In Proceedings of Eurographics/SIGGRAPH Symposium on Computer Animation, 2003.
[13]
Z. Karni and C. Gotsman, Compression of soft-body animation sequences. Computers & Graphics, vol. 28, pp. 25--34, 2004.
[14]
A. Khodakovsky, P. Schröder, and W. Sweldens, Progressive geometry compression. In Proceedings of ACM SIGGRAPH 00, 2000.
[15]
J. E. Lengyel, Compression of Time-Dependent Geometry. In Proceedings of ACM Symposium on Interactive 3D Graphics, New York, 1999.
[16]
J. Li and C. C. Kuo, Progressive coding of 3D graphic models. In Proceedings of IEEE Multimedia and Systems, 1998.
[17]
R. Pajarola and J. Rossignac, Compressed progressive meshes. IEEE Transactions on Visualization and Computer Graphics, vol. 6, 2000.
[18]
J. Popovic and H. H. A. 1997, Progressive simplicial complexes. In Proceedings of ACM SIGGRAPH 97, 1997.
[19]
J. Rossignac, Edgebreaker: Connectivity Compression for Triangle Meshes. IEEE Transactions on Visualization and Computer Graphics, vol. 5, pp. 47--61, 1998.
[20]
R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry: Theory and Applications, vol. 1, pp. 51--64, 1991.
[21]
G. Taubin, A. Gueziec, W. Horn, and F. Lazarus, Progressive Forest Split Compression. In Proceedings of ACM SIGGRAPH 98, 1998.
[22]
G. Taubin and J. Rossignac, 3D Geometry Compression. In ACM SIGGRPAH 98 Course Notes 21, Orlando, Florida, 1998.
[23]
G. Taubin and J. Rossignac, Geometric compression through topological surgery. ACM Transactions on Graphics, vol. 17, pp. 84--115, 1998.
[24]
C. Touma and C. Gotsman, Triangle Mesh Compression. In Proceedings of 24th Conference on Graphics Interface (GI-98), San Francisco, 1998.
[25]
J. Zhang and C. B. Owen, Octree-based Animated Geometry Compression. In Proceedings of Data Compression Conference (DCC'04), Snow Bird, UT, 2004.

Cited By

View all
  • (2022)CSVO: Clustered Sparse Voxel Octrees—A Hierarchical Data Structure for Geometry Representation of Voxelized 3D ScenesSymmetry10.3390/sym1410211414:10(2114)Online publication date: 12-Oct-2022
  • (2009)A new 3D representation and compression algorithm for non-rigid moving objects using affine-octree2009 IEEE International Conference on Systems, Man and Cybernetics10.1109/ICSMC.2009.5346609(3848-3853)Online publication date: Oct-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ACMSE '06: Proceedings of the 44th annual ACM Southeast Conference
March 2006
823 pages
ISBN:1595933158
DOI:10.1145/1185448
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 March 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. animated geometry compression
  2. motion vectors
  3. octree
  4. trilinear interpolation

Qualifiers

  • Article

Conference

ACM SE06
ACM SE06: ACM Southeast Regional Conference
March 10 - 12, 2006
Florida, Melbourne

Acceptance Rates

ACMSE '06 Paper Acceptance Rate 100 of 244 submissions, 41%;
Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)CSVO: Clustered Sparse Voxel Octrees—A Hierarchical Data Structure for Geometry Representation of Voxelized 3D ScenesSymmetry10.3390/sym1410211414:10(2114)Online publication date: 12-Oct-2022
  • (2009)A new 3D representation and compression algorithm for non-rigid moving objects using affine-octree2009 IEEE International Conference on Systems, Man and Cybernetics10.1109/ICSMC.2009.5346609(3848-3853)Online publication date: Oct-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media