A geometric mapping establishes a correspondence between two domains. Since no real
object has zero or negative volume, such a mapping is required to be inversion-free …

Mapping a triangulated surface to 2D space (or a tetrahedral mesh to 3D space) is an
important problem in geometry processing. In computational physics, untangling plays an …

Many computer graphics problems require computing geometric shapes subject to certain
constraints. This often results in non-linear and non-convex optimization problems with …

Many strategies exist for optimizing non-linear distortion energies in geometry and physics
applications, but devising an approach that achieves the convergence promised by Newton …

Surface parameterization is a fundamental problem in computer graphics and geometric
processing; thus, it has been widely used in many applications, such as texture mapping …

We propose a UV mapping algorithm that jointly optimizes for cuts and distortion,
sidestepping heuristics for placing the cuts. The energy we minimize is a state-of-the-art …

Non‐linear optimization is essential to many areas of geometry processing research.
However, when experimenting with different problem formulations or when prototyping new …

Low-distortion mapping of three-dimensional surfaces to the plane is a critical problem in
geometry processing. The intrinsic distortion introduced by these UV mappings is highly …

Optimizing distortion energies over a mesh, in two or three dimensions, is a common and
critical problem in physical simulation and geometry processing. We present three new …

The alternating direction method of multipliers (ADMM) is a popular approach for solving
optimization problems that are potentially non-smooth and with hard constraints. It has been …