Vladimir A. Garanzha
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
Vladimir A. Garanzha has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Liudmila N. Kudryavtseva
Russian Academy of Sciences
10 shared publications - François Protais
LORIA Université de Lorraine CNRS Inria
3 shared publications - Igor Kaporin
Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russia
3 shared publications A. I. Golikov
Russian Academy of Sciences
2 shared publications- Dmitry Sokolov
Université de Lorraine, CNRS, Inria, LORIA
2 shared publications - Lennard Kamenski
Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Russia
2 shared publications
Latest Publications
- 18 December 2024
- Published by Springer Nature
- p. 123-147
Adaptive Mesh Refinement for Electromagnetic Simulation
- 18 December 2024
- Published by Springer Nature
- p. 123-147
Adaptive Mesh Refinement for Electromagnetic Simulation
- Open Access
- 3 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (1) , 1-16
In the Quest for Scale-optimal Mappings
Optimal mapping is one of the longest-standing problems in computational mathematics. It is natural to measure the relative curve length error under map to assess its quality. The maximum of such error is called the quasi-isometry constant, and its minimization is a nontrivial max-norm optimization problem. We present a physics-based quasi-isometric stiffening (QIS) algorithm for the max-norm minimization of hyperelastic distortion. QIS perfectly equidistributes distortion over the entire domain for the ground-truth test (unit hemisphere flattening) and, when it is not possible, tends to create zones where all cells have the same distortion. Such zones correspond to fragments of elastic material that became rigid under stiffening, reaching the deformation limit. As such, maps built by QIS are related to the de Boor equidistribution principle, which asks for an integral of a certain error indicator function to be the same over each mesh cell. Under certain assumptions on the minimization toolbox, we prove that our method can build, in a finite number of steps, a deformation whose maximum distortion is arbitrarily close to the (unknown) minimum. We performed extensive testing: on more than 10,000 domains QIS was reliably better than the competing methods. In summary, we reliably build 2D and 3D mesh deformations with the smallest known distortion estimates for very stiff problems.
- 3 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (1) , 1-16
Open AccessIn the Quest for Scale-optimal Mappings
Optimal mapping is one of the longest-standing problems in computational mathematics. It is natural to measure the relative curve length error under map to assess its quality. The maximum of such error is called the quasi-isometry constant, and its minimization is a nontrivial max-norm optimization problem. We present a physics-based quasi-isometric stiffening (QIS) algorithm for the max-norm minimization of hyperelastic distortion. QIS perfectly equidistributes distortion over the entire domain for the ground-truth test (unit hemisphere flattening) and, when it is not possible, tends to create zones where all cells have the same distortion. Such zones correspond to fragments of elastic material that became rigid under stiffening, reaching the deformation limit. As such, maps built by QIS are related to the de Boor equidistribution principle, which asks for an integral of a certain error indicator function to be the same over each mesh cell. Under certain assumptions on the minimization toolbox, we prove that our method can build, in a finite number of steps, a deformation whose maximum distortion is arbitrarily close to the (unknown) minimum. We performed extensive testing: on more than 10,000 domains QIS was reliably better than the competing methods. In summary, we reliably build 2D and 3D mesh deformations with the smallest known distortion estimates for very stiff problems.
- Open Access
- 1 June 2023
- Published by Walter de Gruyter GmbH in Russian Journal of Numerical Analysis and Mathematical Modelling
- Vol. 38 (3) , 1-3
Frontmatter
Article Frontmatter was published on June 1, 2023 in the journal Russian Journal of Numerical Analysis and Mathematical Modelling (volume 38, issue 3).
- 1 June 2023
- Published by Walter de Gruyter GmbH in Russian Journal of Numerical Analysis and Mathematical Modelling
- Vol. 38 (3) , 1-3
Open AccessFrontmatter
Article Frontmatter was published on June 1, 2023 in the journal Russian Journal of Numerical Analysis and Mathematical Modelling (volume 38, issue 3).
- 1 August 2022
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 62 (8) , 1275-1295
Quasi-Isometric Mesh Movement and Deformation with Geometrically Adaptive Metric
We suggest an algorithm which allows for generation of a moving adaptive mesh with a fixed topology according to the time-dependent geometrically adaptive control metric in the computational domain using a quasi-isometric mesh quality functional. For each time step, we use the preconditioned gradient search technique for the mesh quality functional in order to compute large displacements of each mesh vertex. Intermediate meshes using simple linear interpolation between the initial and the displaced states using time as a parameter, are guaranteed to be nonsingular deformations of the initial mesh. Hence for numerical simulations with small time steps one can use single expensive variational mesh deformation algorithm per 5–10 time steps, which greatly improves the efficiency of the remeshing algorithm for moving mesh flow solvers. Control metric provides anisotropic mesh condensation near boundary of the moving body in the normal direction with special law for normal stretches in the transition zones. Algorithm for computation of target tangential stretches is crucial for realizability of control metric. It takes into account curvature of the boundary surface while small-scale features are represented via medial axis transform. Additional data are encoded on background moving mesh.
- 1 August 2022
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 62 (8) , 1275-1295
Quasi-Isometric Mesh Movement and Deformation with Geometrically Adaptive Metric
We suggest an algorithm which allows for generation of a moving adaptive mesh with a fixed topology according to the time-dependent geometrically adaptive control metric in the computational domain using a quasi-isometric mesh quality functional. For each time step, we use the preconditioned gradient search technique for the mesh quality functional in order to compute large displacements of each mesh vertex. Intermediate meshes using simple linear interpolation between the initial and the displaced states using time as a parameter, are guaranteed to be nonsingular deformations of the initial mesh. Hence for numerical simulations with small time steps one can use single expensive variational mesh deformation algorithm per 5–10 time steps, which greatly improves the efficiency of the remeshing algorithm for moving mesh flow solvers. Control metric provides anisotropic mesh condensation near boundary of the moving body in the normal direction with special law for normal stretches in the transition zones. Algorithm for computation of target tangential stretches is crucial for realizability of control metric. It takes into account curvature of the boundary surface while small-scale features are represented via medial axis transform. Additional data are encoded on background moving mesh.
- 1 August 2022
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 62 (8) , 1203-1216
Non-Simplicial Delaunay Meshing via Approximation by Radical Partitions
We consider the construction of a polyhedral Delaunay partition as a limit of the sequence of power diagrams (in Russian traditionally called radical partitions), while the dual Voronoi diagram is obtained as a limit of the sequence of weighted Delaunay partitions. Using a lifting analogy, this problem is reduced to the construction of a pair of dual convex polyhedra, inscribed and superscribed around a circular paraboloid, as a limit of the sequence of pairs of general dual convex polyhedra. The sequence of primal polyhedra should converge to the superscribed polyhedron, while the sequence of dual polyhedra converges to the inscribed polyhedron. For building sequences of dual polyhedra we are mostly interested in the case when the vertices of primal polyhedra can move or merge together. This means that no new faces are allowed for dual polyhedra. These rules essentially define the transformation of the set of initial spheres defining a power diagram into the set of Delaunay spheres using sphere movement, radius variation, and sphere elimination as admissible operations. Although a rigorous foundation (existence theorems) for this problem is still unavailable, we suggest a functional measuring the deviation of the convex polyhedron from the one inscribed into the paraboloid. This functional is the discrete Dirichlet functional for the power function (power of a point with respect to a ball) which is a linear interpolant of the vertical distance of the dual vertices from the paraboloid. The absolute minimizer of this functional is attained on the constant power field, meaning that the inscribed polyhedron can be obtained using a simple translation. This formulation of the Dirichlet functional for the dual surface is not quadratic since the unknowns are the vertices of the primal polyhedron. Hence, the transformation of the set of spheres into Delaunay spheres is not unique. In this work, we concentrate on the experimental confirmation of the viability of suggested approach and put aside mesh quality problems. The zero value of the gradient of the proposed functional defines a manifold describing the evolution of Delaunay spheres. Hence, Delaunay–Voronoi meshes can be optimized using this manifold as a constraint. Numerical examples illustrate polygonal Delaunay meshing in planar domains.
- 1 August 2022
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 62 (8) , 1203-1216
Non-Simplicial Delaunay Meshing via Approximation by Radical Partitions
We consider the construction of a polyhedral Delaunay partition as a limit of the sequence of power diagrams (in Russian traditionally called radical partitions), while the dual Voronoi diagram is obtained as a limit of the sequence of weighted Delaunay partitions. Using a lifting analogy, this problem is reduced to the construction of a pair of dual convex polyhedra, inscribed and superscribed around a circular paraboloid, as a limit of the sequence of pairs of general dual convex polyhedra. The sequence of primal polyhedra should converge to the superscribed polyhedron, while the sequence of dual polyhedra converges to the inscribed polyhedron. For building sequences of dual polyhedra we are mostly interested in the case when the vertices of primal polyhedra can move or merge together. This means that no new faces are allowed for dual polyhedra. These rules essentially define the transformation of the set of initial spheres defining a power diagram into the set of Delaunay spheres using sphere movement, radius variation, and sphere elimination as admissible operations. Although a rigorous foundation (existence theorems) for this problem is still unavailable, we suggest a functional measuring the deviation of the convex polyhedron from the one inscribed into the paraboloid. This functional is the discrete Dirichlet functional for the power function (power of a point with respect to a ball) which is a linear interpolant of the vertical distance of the dual vertices from the paraboloid. The absolute minimizer of this functional is attained on the constant power field, meaning that the inscribed polyhedron can be obtained using a simple translation. This formulation of the Dirichlet functional for the dual surface is not quadratic since the unknowns are the vertices of the primal polyhedron. Hence, the transformation of the set of spheres into Delaunay spheres is not unique. In this work, we concentrate on the experimental confirmation of the viability of suggested approach and put aside mesh quality problems. The zero value of the gradient of the proposed functional defines a manifold describing the evolution of Delaunay spheres. Hence, Delaunay–Voronoi meshes can be optimized using this manifold as a constraint. Numerical examples illustrate polygonal Delaunay meshing in planar domains.
- 1 April 2022
- Published by Walter de Gruyter GmbH in Russian Journal of Numerical Analysis and Mathematical Modelling
- Vol. 37 (2) , 85-98
Discrete curvatures for planar curves based on Archimedes’ duality principle
We introduce discrete curvatures for planar curves based on the construction of sequences of pairs of mutually dual polylines. For piecewise-regular curves consisting of a finite number of fragments of regular generalized spirals with definite (positive or negative) curvatures our discrete curvatures approximate the exact averaged curvature from below and from above. In order to derive these estimates one should provide a distance function allowing to compute the closest point on the curve for an arbitrary point on the plane.With refinement of the polylines, the averaged curvature over refined curve segments converges to the pointwise values of the curvature and, thus, we obtain a good and stable local approximation of the curvature. For the important engineering case when the curve is approximated only by the inscribed (primal) polyline and the exact distance function is not available, we provide a comparative analysis for several techniques allowing to build dual polylines and discrete curvatures and evaluate their ability to create lower and upper estimates for the averaged curvature.
- 1 April 2022
- Published by Walter de Gruyter GmbH in Russian Journal of Numerical Analysis and Mathematical Modelling
- Vol. 37 (2) , 85-98
Discrete curvatures for planar curves based on Archimedes’ duality principle
We introduce discrete curvatures for planar curves based on the construction of sequences of pairs of mutually dual polylines. For piecewise-regular curves consisting of a finite number of fragments of regular generalized spirals with definite (positive or negative) curvatures our discrete curvatures approximate the exact averaged curvature from below and from above. In order to derive these estimates one should provide a distance function allowing to compute the closest point on the curve for an arbitrary point on the plane.With refinement of the polylines, the averaged curvature over refined curve segments converges to the pointwise values of the curvature and, thus, we obtain a good and stable local approximation of the curvature. For the important engineering case when the curve is approximated only by the inscribed (primal) polyline and the exact distance function is not available, we provide a comparative analysis for several techniques allowing to build dual polylines and discrete curvatures and evaluate their ability to create lower and upper estimates for the averaged curvature.
- Open Access
Practical lowest distortion mapping
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for relative length change).We build our technique upon [Garanzha et al. 2021a], a recently proposed numerical optimization scheme that provably untangles 2D and 3D meshes with inverted elements by partially solving a finite number of minimization problems. In this paper we show the similarity between continuation problems for mesh untangling and for attaining prescribed deformation quality threshold. Both problems can be solved by a finite number of partial solutions of optimization problems which are based on finite element approximations of parameter-dependent hyperelastic functionals. Our method is based on a polyconvex functional which admits a well-posed variational problem. To sum up, we reliably build 2D and 3D mesh deformations with smallest known distortion estimates (quasi-isometry constants) as well as stable quasi conformal parameterizations for very stiff problems.
Open AccessPractical lowest distortion mapping
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for relative length change).We build our technique upon [Garanzha et al. 2021a], a recently proposed numerical optimization scheme that provably untangles 2D and 3D meshes with inverted elements by partially solving a finite number of minimization problems. In this paper we show the similarity between continuation problems for mesh untangling and for attaining prescribed deformation quality threshold. Both problems can be solved by a finite number of partial solutions of optimization problems which are based on finite element approximations of parameter-dependent hyperelastic functionals. Our method is based on a polyconvex functional which admits a well-posed variational problem. To sum up, we reliably build 2D and 3D mesh deformations with smallest known distortion estimates (quasi-isometry constants) as well as stable quasi conformal parameterizations for very stiff problems.
- Open Access
- 1 August 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 40 (4) , 1-16
Foldover-free maps in 50 lines of code
- 1 August 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 40 (4) , 1-16
Open AccessFoldover-free maps in 50 lines of code
- 7 May 2021
- Published by Springer Nature
- p. 157-178
Moving Deforming Mesh Generation Based on the Quasi-Isometric Functional
- 7 May 2021
- Published by Springer Nature
- p. 157-178
Moving Deforming Mesh Generation Based on the Quasi-Isometric Functional
- 7 May 2021
- Published by Springer Nature
- p. 81-93
Polygonal and Polyhedral Delaunay Meshing