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

Map** 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 …

A method is presented to compute volumetric maps and parametrizations of objects over 3D
domains. As a key feature, continuity and bijectivity are ensured by construction. Arbitrary …

A wide array of geometry processing and animation tasks boil down to minimizing a
deformation objective while seeking to achieve both targeted boundary conditions and …

Level of detail has been widely used in interactive computer graphics. In current industrial
3D modeling pipelines, artists rely on commercial software to generate highly detailed …

We present a geometric optimisation framework that can recover fold-over free maps from
non-injective initial states using popular flip-preventing distortion energies. Since flip …

Surface parameterization is of fundamental importance for many tasks in computer vision
and imaging. In recent years, computational quasi-conformal geometry has become an …

We consider the fundamental problem of injectively map** a surface mesh with disk
topology onto a boundary constrained convex domain. We start from the basic observation …

We present a new method to compute continuous and bijective maps (surface
homeomorphisms) between two or more genus‐0 triangle meshes. In contrast to previous …

We provide a set of tools for generating planar embeddings of triangulated topological
spheres. The algorithms make use of Schnyder labelings and realizers. A new …