4 citations · 7 across the 5 of their papers we have counts for
5 papers
Practical lowest distortion mapping
Vladimir Garanzha, Igor Kaporin, Liudmila Kudryavtseva +3
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minim…
Non-simplicial Delaunay meshing via approximation by radical partitions
Vladimir Garanzha, Liudmila Kudryavtseva, Lennard Kamenski
We consider the construction of a polyhedral Delaunay partition as a limit of the sequence of power diagrams (radical partitions). The dual Voronoi diagram is obtained as a limit o…
Foldover-free maps in 50 lines of code
Vladimir Garanzha, Igor Kaporin, Liudmila Kudryavtseva +3
Mapping a triangulated surface to 2D space (or a tetrahedral mesh to 3D space) is the most fundamental problem in geometry processing.In computational physics, untangling plays an…
Construction of near-boundary Voronoi mesh layers for planar domains
V. A. Garanzha, L. N. Kudryavtseva, V. O. Tsvetkova
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth b…
Discrete extrinsic curvatures based on polar polyhedra concept
V. A. Garanzha
Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of…