Related papers: Smooth Interpolation of Key Frames in a Riemannian…

We provide a new approach for computing integrals over hypersurfaces in the level set framework. The method is based on the discretization (via simple Riemann sums) of the classical formulation used in the level set framework, with the…

We formalize a technique for embedding Riemann sufraces properly into \C^2, and we generalize all known embedding results to allow interpolation on prescribed discrete sequences.

This paper outlines a methodology for constructing a geometrically smooth interpolatory curve in $\mathbb{R}^d$ applicable to oriented and flattenable points with $d\ge 2$. The construction involves four essential components: local…

This paper develops a discrete theory of real Riemann surfaces based on quadrilateral cellular decompositions (quad-graphs) and a linear discretization of the Cauchy-Riemann equations. We construct a discrete analogue of an antiholomorphic…

The space of images can be equipped with a Riemannian metric measuring both the cost of transport of image intensities and the variation of image intensities along motion lines. The resulting metamorphosis model was introduced and analyzed…

We present a new way to discretize a geometrically nonlinear elastic planar Cosserat shell. The kinematical model is similar to the general 6-parameter resultant shell model with drilling rotations. The discretization uses geodesic finite…

This paper advocates a novel framework for segmenting a dataset in a Riemannian manifold $M$ into clusters lying around low-dimensional submanifolds of $M$. Important examples of $M$, for which the proposed clustering algorithm is…

Interpolating between points is a problem connected simultaneously with finding geodesics and study of generative models. In the case of geodesics, we search for the curves with the shortest length, while in the case of generative models we…

In this relation I present a technique of construction and fast evaluation of a family of cubic polynomials for analytic smoothing and graphical rendering of particles trajectories for flows in a generic geometry. The principal result of…

Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…

We construct examples of compact and one-ended constant mean curvature surfaces with large mean curvature in Riemannian manifolds with axial symmetry by gluing together small spheres positioned end-to-end along a geodesic. Such surfaces…

We propose a novel 3D shape correspondence method based on the iterative alignment of so-called smooth shells. Smooth shells define a series of coarse-to-fine shape approximations designed to work well with multiscale algorithms. The main…

Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in…

We develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets…

Using a deterministic framework allows us to estimate a function with the purpose of interpolating data in spatial statistics. Radial basis functions are commonly used for scattered data interpolation in a d-dimensional space, however,…

This paper presents an overview of recent developments in the analysis of shapes such as curves and surfaces through Riemannian metrics. We show that several constructions of metrics on spaces of submanifolds can be unified through the…

This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic…

Machine learning has been progressively generalised to operate within non-Euclidean domains, but geometrically accurate methods for learning on surfaces are still falling behind. The lack of closed-form Riemannian operators, the…

Subdivision surfaces are proven to be a powerful tool in geometric modeling and computer graphics, due to the great flexibility they offer in capturing irregular topologies. This paper discusses the robust and efficient implementation of an…

Due to properties such as interpolation, smoothness, and spline connections, Hermite subdivision schemes employ fast iterative algorithms for geometrically modeling curves/surfaces in CAGD and for building Hermite wavelets in numerical…