Numerical computation of shortest paths or geodesics on curved domains, as well as the
associated geodesic distance, arises in a broad range of applications across digital …

This article describes a method for efficiently computing parallel transport of tangent vectors
on curved surfaces, or more generally, any vector-valued data on a curved manifold. More …

Tangles are complex patterns, which are often used to decorate the surface of real-world
artisanal objects. They consist of arrangements of simple shapes organized into nested …

Many computer graphics applications boil down to solving sparse systems of linear
equations. While the current arsenal of numerical solvers available in various specialized …

Quadratic programs (QP), minimizations of quadratic objectives subject to linear inequality
and equality constraints, are at the heart of algorithms across scientific domains …

This study presents the new advances achieved in the field of harbour agitation climate
assessment. Based on the improvement of an elliptic mild-slope model (MSP), which …

We present a novel linear solver for interactive parameterization tasks. Our method is based
on the observation that quasi-conformal parameterizations of a triangle mesh are largely …

Computer animation relies heavily on rigging setups that articulate character surfaces
through a broad range of poses. Although many deformation strategies have been proposed …

A common operation in geometry processing is solving symmetric and positive semi-definite
systems on a subset of a mesh, with conditions for the vertices at the boundary of the region …

We present a fast algorithm for low‐distortion locally injective harmonic mappings of genus 0
triangle meshes with and without cone singularities. The algorithm consists of two portions, a …