Cage‐Based Dynamic Mesh Compression

Abstract Cage‐based deformation is a convenient way to create 3D animations of high‐resolution meshes by means of moving the vertices of a low‐resolution control mesh, the cage. The resulting animation is a dynamic mesh, that is, a sequence of meshes with shared connectivity, which is controlled entirely by the corresponding dynamic cage. In this paper, we propose to invert this process and to approximate a given mesh sequence with a cage‐based animation of the average mesh of that sequence. This process effectively decomposes the data into a static shape, represented by the average mesh, and the motion, given by a dynamic cage sequence. One key application of this representation is data compression. We use mean value coordinates for binding the mesh to the cage and publicly available state‐of‐the‐art algorithms for computing the average mesh and for compressing static and dynamic meshes. Apart from the general idea of inverse cage‐based animation, we describe a novel approach for automatically creating a motion‐aware cage for the average mesh as well as a method for optimizing the latter. Compared to direct compression of the given dynamic mesh, our overall pipeline turns out to give better results at high compression rates, which are the most relevant in practice. Moreover, the decomposition into shape and motion enables the user to modify the input sequence by editing the average mesh and propagating the changes to the whole sequence using the dynamic cage.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-11-13
DOI
https://doi.org/10.1111/cgf.70624
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Cage‐Based Dynamic Mesh Compression

Zuzana Káčereková, Filip Hácha, Libor Váša, Kai Hormann et al.
Computer Graphics Forum
3D Shape Modeling and Analysis
article

Cage‐Based Dynamic Mesh Compression

Zuzana Káčereková, Filip Hácha, Libor Váša, Kai Hormann, Navdeep Singh Bedi
article en

Abstract

Abstract Cage‐based deformation is a convenient way to create 3D animations of high‐resolution meshes by means of moving the vertices of a low‐resolution control mesh, the cage. The resulting animation is a dynamic mesh, that is, a sequence of meshes with shared connectivity, which is controlled entirely by the corresponding dynamic cage. In this paper, we propose to invert this process and to approximate a given mesh sequence with a cage‐based animation of the average mesh of that sequence. This process effectively decomposes the data into a static shape, represented by the average mesh, and the motion, given by a dynamic cage sequence. One key application of this representation is data compression. We use mean value coordinates for binding the mesh to the cage and publicly available state‐of‐the‐art algorithms for computing the average mesh and for compressing static and dynamic meshes. Apart from the general idea of inverse cage‐based animation, we describe a novel approach for automatically creating a motion‐aware cage for the average mesh as well as a method for optimizing the latter. Compared to direct compression of the given dynamic mesh, our overall pipeline turns out to give better results at high compression rates, which are the most relevant in practice. Moreover, the decomposition into shape and motion enables the user to modify the input sequence by editing the average mesh and propagating the changes to the whole sequence using the dynamic cage.

Computer Graphics Forum
Università della Svizzera italiana (CH), University of West Bohemia in Pilsen (CZ)
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, Grantová Agentura České Republiky
3D Shape Modeling and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon