Denis Zorin
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
Denis Zorin has a total of 133 co-authors. Here are the top co-authors by number of shared publications:
- Daniele Panozzo
New York University, New York, USA
23 shared publications - Teseo Schneider
University of Victoria, Victoria, Canada
8 shared publications - Zizhou Huang
New York University, New York, USA
8 shared publications - Evgeny Burnaev
Skolkovo Institute of Science and Technology
6 shared publications - Abtin Rahimian
Department of Computer Science University of Colorado -Boulder 80309 Boulder CO
5 shared publications - Alexey Artemov
Skolkovo Institute of Science and Technology
5 shared publications
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Extremum Sum Proximity Potential
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessExtremum Sum Proximity Potential
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
A Purely Algebraic Solver for Locally Stiff Linear Systems
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessA Purely Algebraic Solver for Locally Stiff Linear Systems
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-21
Efficient and Robust Seamless Parametrization
Seamless surface parametrizations support many important geometry processing tasks, including quad meshing, texture mapping, and patch-based surface representations. Recent intrinsic approaches based on Penner coordinates provide a robust mechanism for constructing feasible, seamless parametrizations with prescribed topological structure, determined by a guiding field on a surface and detected feature lines, overcoming many robustness limitations of previous methods. However, these methods rely on highly accurate nonlinear solves, which present a significant obstacle to scalability on large, densely sampled meshes. We address this challenge by observing that Penner-coordinate methods are primarily needed to establish an initial feasible solution whose structure depends on overall guiding field topology and surface topology rather than fine geometric detail, and that high-precision optimization is unnecessary for achieving high-quality results at full resolution, as long as the coarse initial solution can be transferred to the fine levels, while maintaining constraints. We propose a three-scale pipeline that combines an efficient hierarchical approach with robust Penner-coordinate methods. Our method computes guiding fields and holonomy on a medium-resolution mesh, solves the Penner-coordinate feasibility problem efficiently on a coarse mesh that permits connectivity changes, and transfers the resulting structure to the original fine mesh, where only a final, scalable optimization and quantization are performed. Experiments on large benchmark and real-world models demonstrate substantial speedups with no change in robustness in the processing of meshes with millions of triangles.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-21
Open AccessEfficient and Robust Seamless Parametrization
Seamless surface parametrizations support many important geometry processing tasks, including quad meshing, texture mapping, and patch-based surface representations. Recent intrinsic approaches based on Penner coordinates provide a robust mechanism for constructing feasible, seamless parametrizations with prescribed topological structure, determined by a guiding field on a surface and detected feature lines, overcoming many robustness limitations of previous methods. However, these methods rely on highly accurate nonlinear solves, which present a significant obstacle to scalability on large, densely sampled meshes. We address this challenge by observing that Penner-coordinate methods are primarily needed to establish an initial feasible solution whose structure depends on overall guiding field topology and surface topology rather than fine geometric detail, and that high-precision optimization is unnecessary for achieving high-quality results at full resolution, as long as the coarse initial solution can be transferred to the fine levels, while maintaining constraints. We propose a three-scale pipeline that combines an efficient hierarchical approach with robust Penner-coordinate methods. Our method computes guiding fields and holonomy on a medium-resolution mesh, solves the Penner-coordinate feasibility problem efficiently on a coarse mesh that permits connectivity changes, and transfers the resulting structure to the original fine mesh, where only a final, scalable optimization and quantization are performed. Experiments on large benchmark and real-world models demonstrate substantial speedups with no change in robustness in the processing of meshes with millions of triangles.
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Solid-Shell Labeling for Discrete Surfaces
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessSolid-Shell Labeling for Discrete Surfaces
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Intersection-Free Garment Retargeting
- 27 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessIntersection-Free Garment Retargeting
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Topological Offsets
We introduce Topological Offsets , a novel approach to generate manifold and self-intersection-free offset surfaces that are topologically equivalent to an offset infinitesimally close to the surface. Our approach, by construction, creates a manifold, watertight, and self-intersection-free offset surface strictly enclosing the input, while doing a best effort to move it to a prescribed distance from the input. Differently from existing approaches, we embed the input in a background mesh and insert a topological offset around the input with purely combinatorial operations. The topological offset is then inflated/deflated to match the user-prescribed distance while enforcing that no intersections or non-manifold configurations are introduced. We evaluate the effectiveness and robustness of our approach on the Thingi10k dataset, and show that topological offsets are beneficial in multiple graphics applications, including (1) converting non-manifold surfaces to manifold ones, (2) creating layered offsets, and (3) reliably computing finite offsets.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Open AccessTopological Offsets
We introduce Topological Offsets , a novel approach to generate manifold and self-intersection-free offset surfaces that are topologically equivalent to an offset infinitesimally close to the surface. Our approach, by construction, creates a manifold, watertight, and self-intersection-free offset surface strictly enclosing the input, while doing a best effort to move it to a prescribed distance from the input. Differently from existing approaches, we embed the input in a background mesh and insert a topological offset around the input with purely combinatorial operations. The topological offset is then inflated/deflated to match the user-prescribed distance while enforcing that no intersections or non-manifold configurations are introduced. We evaluate the effectiveness and robustness of our approach on the Thingi10k dataset, and show that topological offsets are beneficial in multiple graphics applications, including (1) converting non-manifold surfaces to manifold ones, (2) creating layered offsets, and (3) reliably computing finite offsets.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-24
Geometric Contact Potential
Barrier potentials gained popularity as a means for robust contact handling in physical modeling and for modeling self-avoiding shapes. The key to the success of these approaches is adherence to geometric constraints, i.e., avoiding intersections, which are the cause of most robustness problems in complex deformation simulation with contact. However, existing barrier-potential methods may lead to spurious forces and imperfect satisfaction of the geometric constraints. They may have strong resolution dependence, requiring careful adaptation of the potential parameters to the object discretizations. We present a systematic derivation of a continuum potential defined for smooth and piecewise smooth surfaces, starting from identifying a set of natural requirements for contact potentials, including the barrier property, locality, differentiable dependence on shape, and absence of forces in rest configurations. Our potential is formulated independently of surface discretization and addresses the shortcomings of existing potential-based methods while retaining their advantages. We present a discretization of our potential that is a drop-in replacement for the potential used in the incremental potential contact formulation [Li et al. 2020], and compare its behavior to other potential formulations, demonstrating that it has the expected behavior. The presented formulation connects existing barrier approaches, as all recent existing methods can be viewed as a variation of the presented potential, and lays a foundation for developing alternative (e.g., higher-order) versions.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-24
Open AccessGeometric Contact Potential
Barrier potentials gained popularity as a means for robust contact handling in physical modeling and for modeling self-avoiding shapes. The key to the success of these approaches is adherence to geometric constraints, i.e., avoiding intersections, which are the cause of most robustness problems in complex deformation simulation with contact. However, existing barrier-potential methods may lead to spurious forces and imperfect satisfaction of the geometric constraints. They may have strong resolution dependence, requiring careful adaptation of the potential parameters to the object discretizations. We present a systematic derivation of a continuum potential defined for smooth and piecewise smooth surfaces, starting from identifying a set of natural requirements for contact potentials, including the barrier property, locality, differentiable dependence on shape, and absence of forces in rest configurations. Our potential is formulated independently of surface discretization and addresses the shortcomings of existing potential-based methods while retaining their advantages. We present a discretization of our potential that is a drop-in replacement for the potential used in the incremental potential contact formulation [Li et al. 2020], and compare its behavior to other potential formulations, demonstrating that it has the expected behavior. The presented formulation connects existing barrier approaches, as all recent existing methods can be viewed as a variation of the presented potential, and lays a foundation for developing alternative (e.g., higher-order) versions.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-18
MiSo: A DSL for Robust and Efficient Solve and MInimize Problems
Many problems in computer graphics can be formulated as finding the global minimum of a function subject to a set of non-linear constraints (Minimize), or finding all solutions of a system of non-linear constraints (Solve). We introduce MiSo, a domain-specific language and compiler for generating efficient C++ code for low-dimensional Minimize and Solve problems, that uses interval methods to guarantee conservative results while using floating point arithmetic. We demonstrate that MiSo-generated code shows competitive performance compared to hand-optimized codes for several computer graphics problems, including high-order collision detection with non-linear trajectories, surface-surface intersection, and geometrical validity checks for finite element simulation.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-18
Open AccessMiSo: A DSL for Robust and Efficient Solve and MInimize Problems
Many problems in computer graphics can be formulated as finding the global minimum of a function subject to a set of non-linear constraints (Minimize), or finding all solutions of a system of non-linear constraints (Solve). We introduce MiSo, a domain-specific language and compiler for generating efficient C++ code for low-dimensional Minimize and Solve problems, that uses interval methods to guarantee conservative results while using floating point arithmetic. We demonstrate that MiSo-generated code shows competitive performance compared to hand-optimized codes for several computer graphics problems, including high-order collision detection with non-linear trajectories, surface-surface intersection, and geometrical validity checks for finite element simulation.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-21
Feature-Aligned Parametrization in Penner Coordinates
Parametrization is a key element of many geometric modeling tasks. Seamless parametrization, in particular, is needed as a starting point for many algorithms for quadrangulation and conversion to high-order patches, as well as for the construction of seamless texture maps and displacement maps. Seamless parametrizations are difficult to compute robustly, in part because, in general, it is not known if one exists for a given mesh connectivity or for a particular configuration of singularities. Recently, Penner-coordinate-based methods that allow for connectivity changes have been shown to achieve a perfect success rate on a widely used dataset (Thingi10k). However, previously proposed Penner coordinate methods do not support sharp feature alignment or soft alignment with preferred directions on the surface, both of which are important for practical applications, especially those involving models with sharp features. In this paper, we extend Penner coordinates to surfaces with sharp features to which the parametrization needs to be aligned. Our algorithm extends the holonomy signature description of seamless parametrizations to surfaces with marked feature curves. We describe sufficient conditions for obtaining feasible solutions and describe a two-phase method to efficiently enforce feature constraints or minimize residual errors when solutions are unattainable. We demonstrate that the resulting algorithm works robustly on the Thingi10k dataset with automatic feature labeling, and the resulting seamless parametrizations can be optimized, quantized, and quadrangulated, completing the quad mesh generation pipeline.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-21
Open AccessFeature-Aligned Parametrization in Penner Coordinates
Parametrization is a key element of many geometric modeling tasks. Seamless parametrization, in particular, is needed as a starting point for many algorithms for quadrangulation and conversion to high-order patches, as well as for the construction of seamless texture maps and displacement maps. Seamless parametrizations are difficult to compute robustly, in part because, in general, it is not known if one exists for a given mesh connectivity or for a particular configuration of singularities. Recently, Penner-coordinate-based methods that allow for connectivity changes have been shown to achieve a perfect success rate on a widely used dataset (Thingi10k). However, previously proposed Penner coordinate methods do not support sharp feature alignment or soft alignment with preferred directions on the surface, both of which are important for practical applications, especially those involving models with sharp features. In this paper, we extend Penner coordinates to surfaces with sharp features to which the parametrization needs to be aligned. Our algorithm extends the holonomy signature description of seamless parametrizations to surfaces with marked feature curves. We describe sufficient conditions for obtaining feasible solutions and describe a two-phase method to efficiently enforce feature constraints or minimize residual errors when solutions are unattainable. We demonstrate that the resulting algorithm works robustly on the Thingi10k dataset with automatic feature labeling, and the resulting seamless parametrizations can be optimized, quantized, and quadrangulated, completing the quad mesh generation pipeline.
- Open Access
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (5) , 1-19
High-Order Continuous Geometrical Validity
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform linearly within a time interval. Our algorithm uses a combination of adaptive Bézier refinement and bisection search to determine if, when, and where the Jacobian determinant of an element’s polynomial geometric map becomes negative in the transition from one configuration to another. In elastodynamic simulation, our algorithm guarantees that the system remains physically valid during the entire trajectory, not only at discrete time steps. Unlike previous approaches, physical validity is preserved even when our method is implemented using floating point arithmetic. Hence, our algorithm is only slightly slower than existing non-conservative methods while providing guarantees and while being an easy drop-in replacement for current validity tests. To prove the practical effectiveness of our algorithm, we demonstrate its use in a high-order Incremental Potential Contact (IPC) elastodynamic simulator and experimentally show that it prevents invalid, simulation-breaking configurations that would otherwise occur using non-conservative methods.
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (5) , 1-19
Open AccessHigh-Order Continuous Geometrical Validity
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform linearly within a time interval. Our algorithm uses a combination of adaptive Bézier refinement and bisection search to determine if, when, and where the Jacobian determinant of an element’s polynomial geometric map becomes negative in the transition from one configuration to another. In elastodynamic simulation, our algorithm guarantees that the system remains physically valid during the entire trajectory, not only at discrete time steps. Unlike previous approaches, physical validity is preserved even when our method is implemented using floating point arithmetic. Hence, our algorithm is only slightly slower than existing non-conservative methods while providing guarantees and while being an easy drop-in replacement for current validity tests. To prove the practical effectiveness of our algorithm, we demonstrate its use in a high-order Incremental Potential Contact (IPC) elastodynamic simulator and experimentally show that it prevents invalid, simulation-breaking configurations that would otherwise occur using non-conservative methods.