Related papers: Relative Geodesics in the Special Euclidean Group

A naturally parameterised curve in a Lie group with a left invariant metric is a geodesic, if its tangent vector left-translated to the identity satisfies the Euler equation $\dot{Y}=\operatorname{ad}^t_YY$ on the Lie algebra $\mathfrak{g}$…

Many geometric machine learning and image analysis applications, require a left-invariant metric on the 5D homogeneous space of 3D positions and orientations SE(3)/SO(2). This is done in Equivariant Neural Networks (G-CNNs), or in PDE-Based…

To accomplish a task within limited operation time typically requires an excess expense of energy, whose minimum is of practical importance for the optimal design in various applications, especially in the industrial separation of mixtures…

We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…

We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…

It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…

The main purpose of this article is to study conditions for a curve on a submanifold $M\subset\mathbb{R}^n$, constructed in a particular way involving the Euclidean distance to $M$, to be a geodesic. We also present the naturally arising…

Channel Charting is a dimensionality reduction technique that learns to reconstruct a low-dimensional, physically interpretable map of the radio environment by taking advantage of similarity relationships found in high-dimensional channel…

This paper studies the problem of discrepancy estimates for pseudorandom vectors constructed by the elliptic curve congruential generator, particularly in the non-translational case. Two families of results are obtained. First, in a…

The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as…

Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…

This paper defines the notion of class discrepancy for families of functions. It shows that low discrepancy classes admit small offline and streaming coresets. We provide general techniques for bounding the class discrepancy of machine…

We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.

A geometric transition is a continuous path of geometric structures that changes type, meaning that the model geometry, i.e. the homogeneous space on which the structures are modeled, abruptly changes. In order to rigorously study…

We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for…

Michor and Mumford have shown that the distances between planar curves in the simplest metric (not involving derivatives) are identically zero. We consider two conformally equivalent metrics for which the distances between curves are…

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

The mathematical treatment and graphical representation of Special Relativity (SR) are well established, yet carry deep implications that remain hard to visualize. This paper presents a new graphical interpretation of the geometry of SR…

Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…