This paper describes a method for fast simplification of surface meshes. Whereas past
methods focus on visual appearance, our goal is to solve equations on the surface. Hence …

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 introduce a method for approximating the signed distance function (SDF) of geometry
corrupted by holes, noise, or self-intersections. The method implicitly defines a completed …

Basic Problem. Any collection of unbroken (ie, closed), oriented loops can be decomposed
into subsets that do and do not bound regions of a surface"(Figure 1). Informally, we wish to …

This course provides a first introduction to intrinsic triangulations and their use in mesh
processing algorithms. As geometric data becomes more ubiquitous, eg, in applications …

Abstract As‐rigid‐as‐possible (ARAP) surface modelling is widely used for interactive
deformation of triangle meshes. We show that ARAP can be interpreted as minimizing a …

Constructing well‐behaved Laplacian and mass matrices is essential for tetrahedral mesh
processing. Unfortunately, the de facto standard linear finite elements exhibit bias on …

A parameterization of a triangle mesh is a realization in the plane so that all triangles have
positive signed area. Triangle mesh parameterizations are commonly computed by …

Skinning is a popular way to rig and deform characters for animation, to compute reduced-
order simulations, and to define features for geometry processing. Methods built on skinning …

Computing intrinsic distances on discrete surfaces is at the heart of many minimization
problems in geometry processing and beyond. Solving these problems is extremely …