Zuzana Káčereková
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zuzana Káčereková has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Libor Váša
University of West Bohemia, Plzen, Czech Republic
3 shared publications - Filip Hácha
University of West Bohemia Plzeň Czech Republic
2 shared publications - Jan Dvořák
University of West Bohemia
1 shared publication - Kai Hormann
Università della Svizzera Italiana Lugano Switzerland
1 shared publication - Lukáš Hruda
Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Pilsen, Czech Republic
1 shared publication - Navdeep Singh Bedi
Università Della Svizzera italiana, Lugano, Switzerland
1 shared publication
Latest Publications
- Open Access
- 13 November 2026
- Published by Wiley in Computer Graphics Forum
Cage‐Based Dynamic Mesh Compression
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.
- 13 November 2026
- Published by Wiley in Computer Graphics Forum
Open AccessCage‐Based Dynamic Mesh Compression
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.
- Open Access
- 15 August 2026
- Published by Elsevier in Computers & Graphics
- Vol. 140
Faster progressive geometry compression via normal uncertainty
- 15 August 2026
- Published by Elsevier in Computers & Graphics
- Vol. 140
Open AccessFaster progressive geometry compression via normal uncertainty
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 149-154
Comparing Interpolations Using Standard and Normalized Radial Basis Functions
Radial basis functions (RBFs) are commonly used in solving partial differential equations, interpolation and ap-proximation of scalar and vector data, image reconstruction, geographic information systems, and machine learning. In this contribution, the properties of interpolations using standard and normalized RBFs are compared, and the impact of an added polynomial term is analyzed using various samplings of input functions. Experimental results across a range of tested kernel functions and shape parameters are provided.
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 149-154
Comparing Interpolations Using Standard and Normalized Radial Basis Functions
Radial basis functions (RBFs) are commonly used in solving partial differential equations, interpolation and ap-proximation of scalar and vector data, image reconstruction, geographic information systems, and machine learning. In this contribution, the properties of interpolations using standard and normalized RBFs are compared, and the impact of an added polynomial term is analyzed using various samplings of input functions. Experimental results across a range of tested kernel functions and shape parameters are provided.
- 1 February 2022
- Published by Elsevier in Computers & Graphics
- Vol. 102, 329-338
As-rigid-as-possible volume tracking for time-varying surfaces
- 1 February 2022
- Published by Elsevier in Computers & Graphics
- Vol. 102, 329-338
As-rigid-as-possible volume tracking for time-varying surfaces