Related papers: Relative Geodesics in the Special Euclidean Group
We present an elementary criterion to show the length-minimizing property of geodesics for a large class of conformal metrics. In particular, we prove the length-minimizing property of level curves of harmonic functions and the…
We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…
It is proved that the set of geodesic circles in two dimensions may be given a variational description and the explicit form of it is presented. In the limit case of the Euclidean geometry a certain claim of uniqueness of such description…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
The Riesz $s$-energy of an $N$-point configuration in the Euclidean space $\mathbb{R}^{p}$ is defined as the sum of reciprocal $s$-powers of all mutual distances in this system. In the limit $s\to0$ the Riesz $s$-potential $1/r^s$ ($r$ the…
Near a singular point of a surface or a curve, geometric invariants diverge in general, and the orders of diverge, in particular the boundedness about these invariants represent geometry of the surface and the curve. In this paper, we study…
Starting with an exact and simple geodesic, we generate approximate geodesics by summing up higher-order geodesic deviations within a General Relativistic setting, without using Newtonian and post-Newtonian approximations. We apply this…
The geodesic has a fundamental role in physics and in mathematics: roughly speaking, it represents the curve that minimizes the arc length between two points on a manifold. We analyze a basic but misinterpreted difference between the…
To numerically approximate Borel probability measures by finite atomic measures, we study the spectral decomposition of discrepancy kernels when restricted to compact subsets of $\mathbb{R}^d$. For restrictions to the Euclidean ball in odd…
We find geodesics, shortest arcs, cut loci, first conjugate loci, distances between arbitrary elements for some left-invariant sub-Riemannian metrics on the Lie groups $SU(2)\times\mathbb{R}$ and $SO(3)\times\mathbb{R}$.
We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.
We introduce a theory of relative tangency for projective algebraic varieties. The dual variety $X_Z^\vee$ of a variety $X$ relative to a subvariety $Z$ is the set of hyperplanes tangent to $X$ at a point of $Z$. We also introduce the…
A random geometric graph, $G(n,r)$, is formed by choosing $n$ points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if they are at Euclidean distance at most $r$. For a given…
Although the geometric equality of figures has already been studied thoroughly, little work has been done about the comparison of unequal figures. We are used to compare only similar figures but would it be meaningful to compare non similar…
We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…
Divergence functions are interesting discrepancy measures. Even though they are not true distances, we can use them to measure how separated two points are. Curiously enough, when they are applied to random variables, they lead to a notion…
Given a set of points in the Euclidean space $\mathbb{R}^\ell$ with $\ell>1$, the pairwise distances between the points are determined by their spatial location and the metric $d$ that we endow $\mathbb{R}^\ell$ with. Hence, the distance…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
Pseudospectral approximation provides a means to approximate the dynamics of delay differential equations (DDE) by ordinary differential equations (ODE). This article develops a computer-aided algorithm to determine the distance between the…
In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…