Aleksei Kalinov
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
Aleksei Kalinov has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Chris Wojtan
Institute of Science and Technology Austria, Klosterneuburg, Austria
2 shared publications - Alexander Osinsky
Skolkovo Institute of Science and Technology, Moscow, Russia
1 shared publication - Andrey Ivanov
Skolkovo Institute of Science and Technology, Moscow, Russia
1 shared publication - Arian Etemadi
ISTA (Institute of Science and Technology Austria), Klosterneuburg, Austria
1 shared publication - Christian Hafner
Institute of Science and Technology Austria, Klosterneuburg, Austria
1 shared publication Dmitry Yarotsky
Skolkovo Institute of Science and Technology, Russia
1 shared publication
Latest Publications
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-13
Physics-Inspired Procedural Texturing of Extremely Deformable Surfaces
The appearance of simulated natural phenomena heavily depends on the way surfaces are textured. However, applying texture maps to dynamic deformable surfaces presents a significant challenge, due to ever-shifting differences in length scales involved. When these surfaces move and advect the texture along with them, their final appearance degrades as deformed regions dramatically distort their texture map. Modifications to the texture directly at the pixel level in response to the deformation may introduce ghosting artifacts and look unnatural. In the real world, the appearance of surface details on a deforming material changes through the interplay of physical processes such as rupturing, exposure of internal structure, or wrinkling. Motivated by these behaviors, in this work we explore how physical principles can guide the texturing methods based on the measure of surface deformation. We present two novel wave-based procedural texturing algorithms which reproduce common physical properties like advection and self-similarity, enabling the plausible animation of deforming objects with extreme texture map distortions. Our algorithms are fully procedural, require no actual physics simulation, and store no state or history of deformation besides the input UV map, making them highly parallelizable on the GPU and efficient enough for real-time applications. We show the versatility of the method by animating physical phenomena with extreme deformations such as flowing lava, stretching putty and outpouring sludge.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-13
Open AccessPhysics-Inspired Procedural Texturing of Extremely Deformable Surfaces
The appearance of simulated natural phenomena heavily depends on the way surfaces are textured. However, applying texture maps to dynamic deformable surfaces presents a significant challenge, due to ever-shifting differences in length scales involved. When these surfaces move and advect the texture along with them, their final appearance degrades as deformed regions dramatically distort their texture map. Modifications to the texture directly at the pixel level in response to the deformation may introduce ghosting artifacts and look unnatural. In the real world, the appearance of surface details on a deforming material changes through the interplay of physical processes such as rupturing, exposure of internal structure, or wrinkling. Motivated by these behaviors, in this work we explore how physical principles can guide the texturing methods based on the measure of surface deformation. We present two novel wave-based procedural texturing algorithms which reproduce common physical properties like advection and self-similarity, enabling the plausible animation of deforming objects with extreme texture map distortions. Our algorithms are fully procedural, require no actual physics simulation, and store no state or history of deformation besides the input UV map, making them highly parallelizable on the GPU and efficient enough for real-time applications. We show the versatility of the method by animating physical phenomena with extreme deformations such as flowing lava, stretching putty and outpouring sludge.
- Open Access
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-14
Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes
We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles.
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-14
Open AccessMulti-Material Mesh-Based Surface Tracking with Implicit Topology Changes
We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles.
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (3) , 537-541
Machine Learning-Assisted PAPR Reduction in Massive MIMO
In this letter, we propose a machine learning (ML) approach to peak-to-average power ratio (PAPR) reduction in the downlink channel of the digital Massive Multiple Input Multiple Output (MIMO) system with orthogonal frequency division multiplexing (OFDM) signal. Naturally, substantial PAPR reduction is achieved when the noise after PAPR reduction is distributed in both frequency and spatial domains following the maximum allowed error vector magnitude (EVM). However, such an approach requires time-consuming manual tuning of hyperparameters for each scenario. To overcome this problem, we propose to compute an optimal hyperparameter function. Then we propose an efficient approximation for this function to enable the PAPR reduction based on the classical ML approaches.
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (3) , 537-541
Machine Learning-Assisted PAPR Reduction in Massive MIMO
In this letter, we propose a machine learning (ML) approach to peak-to-average power ratio (PAPR) reduction in the downlink channel of the digital Massive Multiple Input Multiple Output (MIMO) system with orthogonal frequency division multiplexing (OFDM) signal. Naturally, substantial PAPR reduction is achieved when the noise after PAPR reduction is distributed in both frequency and spatial domains following the maximum allowed error vector magnitude (EVM). However, such an approach requires time-consuming manual tuning of hyperparameters for each scenario. To overcome this problem, we propose to compute an optimal hyperparameter function. Then we propose an efficient approximation for this function to enable the PAPR reduction based on the classical ML approaches.