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 …

This paper describes a numerical method for surface parameterization, yielding maps that
are locally injective and discretely conformal in an exact sense. Unlike previous methods for …

Computing constrained mappings between domains is a fundamental task, performed
across a wide range of geometric and physical applications ranging from parameterization …

We describe a method for the generation of seamless surface parametrizations with
guaranteed local injectivity and full control over holonomy. Previous methods guarantee …

We propose a novel method to efficiently compute bijective parameterizations with low
distortion on disk topology meshes. Our method relies on a second-order solver. To design …

Seamless global parametrization of surfaces is a key operation in geometry processing, eg,
for high-quality quad mesh generation. A common approach is to prescribe the parametric …

An efficient surface reconstruction strategy is presented in this study, which is able to
approximate non‐convex sets of target points (TPs). The approach is split in two phases:(a) …

We present a highly efficient-and-robust method for free-boundary flattening of disk-like
triangle meshes in a globally injective manner. We show that by restricting the solution to a …

Computing injective maps with low distortions is a long-standing problem in computer
graphics. Such maps are particularly challenging to obtain in the presence of positional …

Optimizing Global Injectivity for Constrained Parameterization Page 1 Optimizing Global
Injectivity for Constrained Parameterization XINGYI DU, Washington University in St. Louis …