Related papers: Riemannian simplices and triangulations
We define barycentric coordinates on a Riemannian manifold using Karcher's center of mass technique applied to point masses for n+1 sufficiently close points, determining an n-dimensional Riemannian simplex defined as a "Karcher simplex."…
(1) For a compact Riemannian manifold without boundary $(M,g)$ containing $n+1$ points $p_i$ and the $n$-dimensional standard simplex $\Delta$, the miniser of \[ E: M \times \Delta \to {\mathbf R}, (a,\lambda) \mapsto \lambda^0 d^2(a,p_0) +…
We quantify conditions that ensure that a signed measure on a Riemannian manifold has a well defined centre of mass. We then use this result to quantify the extent of a neighbourhood on which the Riemannian barycentric coordinates of a set…
Riemannian geometry provides the fundamental framework for optimization on nonlinear spaces such as matrix manifolds, which arise in machine learning, signal processing, and robotics. While the underlying theory is classical, existing…
This paper is a short summary of our recent work on the medians and means of probability measures in Riemannian manifolds. Firstly, the existence and uniqueness results of local medians are given. In order to compute medians in practical…
In this paper, we introduce the notion of generalized $\epsilon$-stationarity for a class of nonconvex and nonsmooth composite minimization problems on compact Riemannian submanifold embedded in Euclidean space. To find a generalized…
Let $M$ be a connected, non-compact $m$-dimensional Riemannian manifold. In this paper we consider smooth maps $\phi: M \to \mathbb{R}^n$ with images inside a non-degenerate cone. Under quite general assumptions on $M$, we provide a lower…
We show that compact Riemannian manifolds, regarded as metric spaces with their global geodesic distance, cannot contain a number of rigid structures such as (a) arbitrarily large regular simplices or (b) arbitrarily long sequences of…
Shape spaces are fundamental in a variety of applications including image registration, morphing, matching, interpolation, and shape optimization. In this work, we consider two-dimensional shapes represented by triangular meshes of a given…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
In this work, we generalize the probability simplex constraint to matrices, i.e., $\mathbf{X}_1 + \mathbf{X}_2 + \ldots + \mathbf{X}_K = \mathbf{I}$, where $\mathbf{X}_i \succeq 0$ is a symmetric positive semidefinite matrix of size…
Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…
We address the problem of computing Riemannian normal coordinates on the real, compact Stiefel manifold of orthogonal frames. The Riemannian normal coordinates are based on the so-called Riemannian exponential and the Riemannian logarithm…
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…
We study optimization over Riemannian embedded submanifolds, where the objective function is relatively smooth in the ambient Euclidean space. Such problems have broad applications but are still largely unexplored. We introduce two…
We study unimodular measures on the space $\mathcal M^d$ of all pointed Riemannian $d$-manifolds. Examples can be constructed from finite volume manifolds, from measured foliations with Riemannian leaves, and from invariant random subgroups…
We consider a class of nonsmooth optimization problems over the Stiefel manifold, in which the objective function is weakly convex in the ambient Euclidean space. Such problems are ubiquitous in engineering applications but still largely…
Various tasks in scientific computing can be modeled as an optimization problem on the indefinite Stiefel manifold. We address this using the Riemannian approach, which basically consists of equipping the feasible set with a Riemannian…
This article proves that if M is a smooth manifold of dimension at least four, then for generic choice of metric on M, all prime parametrized minimal surfaces in M are free of branch points and lie on nondegenerate critical submanifolds for…
A generalisation of Riemannian geometry is considered, based exclusively on the minimal assumptions that the line element $ds$ is a regular function of position and direction and that the distance of every point from itself is equal to…