Related papers: Computing distances on Riemann surfaces
Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice,…
We describe how to approximate the Riemann curvature tensor as well as sectional curvatures on possibly infinite-dimensional shape spaces that can be thought of as Riemannian manifolds. To this end, we extend the variational time…
In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…
The Geometric Shafarevich Conjecture and the Theorem of de Franchis state the finiteness of the number of certain holomorphic objects on closed or punctured Riemann surfaces. The analog of these kind of theorems for Riemann surfaces of…
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…
We construct a Riemannian metric $g$ on $\mathbb{R}^4$ (arbitrarily close to the euclidean one) and a smooth simple closed curve $\Gamma\subset \mathbb R^4$ such that the unique area minimizing surface spanned by $\Gamma$ has infinite…
This study aims to better understand the functional geometry of the motor cortex, starting from different sources of experimental evidence. Recent studies have proved that cells of the primary motor cortex (M1) are sensitive to short hand…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. This link makes possible a better understanding of both…
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present…
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and…
The aim of this article is to present a comparative review of Riemannian and Finsler geometry. The structures of cut and conjugate loci on Riemannian manifolds have been discussed by many geometers including H. Busemann, M. Berger and W.…
Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann…
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…
Projecting the distance measures onto a low-dimensional space is an efficient way of mitigating the curse of dimensionality in the classical Wasserstein distance using optimal transport. The obtained maximized distance is referred to as…
We study some Riemannian metrics on the space of regular smooth curves in the plane, viewed as the orbit space of maps from $S^1$ to the plane modulo the group of diffeomorphisms of $S^1$, acting as reparameterizations. In particular we…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
We show that the Fr\'echet distance of two-dimensional parametrised surfaces in a metric space is computable in the bit-model of real computation. An analogous result in the real RAM model for piecewise-linear surfaces has recently been…
We improve the current best bound for distinct distances on non-ruled algebraic surfaces in ${\mathbb R}^3$. In particular, we show that $n$ points on such a surface span $\Omega\left(n^{32/39-\varepsilon}\right)$ distinct distances, for…