Related papers: An introduction to geodesics: the shortest distanc…
We present a novel approach to geolocalising panoramic images on a 2-D cartographic map based on learning a low dimensional embedded space, which allows a comparison between an image captured at a location and local neighbourhoods of the…
We study counting limit laws that compare length functions on infinite graphs. We then apply these results to flat surfaces to obtain a statistical comparison between the geometric length and the number of singularities visited by geodesic…
We take a three dimensional Euclidian metric in toroidal coordinates and consider the corresponding Laplace equation. The simplest solution of this equation is taken. Based on this we build a Weyl space-time. This space-time is transformed…
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…
We analyze a variational time discretization of geodesic calculus on finite- and certain classes of infinite-dimensional Riemannian manifolds. We investigate the fundamental properties of discrete geodesics, the associated discrete…
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph $G$, i.e., an unweighted graph in which the shortest path between any…
For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate agent) and efficiency (i.e., messages are delivered through…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n)…
Machine learning problems have an intrinsic geometric structure as central objects including a neural network's weight space and the loss function associated with a particular task can be viewed as encoding the intrinsic geometry of a given…
We study geodesics on the parameter manifold, for systems exhibiting second order classical and quantum phase transitions. The coupled non-linear geodesic equations are solved numerically for a variety of models which show such phase…
Comparing two geometric graphs embedded in space is important in the field of transportation network analysis. Given street maps of the same city collected from different sources, researchers often need to know how and where they differ.…
The geodesic deviation equation (GDE) describes the tendency of objects to accelerate towards or away from each other due to spacetime curvature. The GDE assumes that nearby geodesics have a small rate of separation, which is formally…
Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…
We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" $F$, i.e., a union of curves of minimum total length, that separates every two objects of different colors. Two…
A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
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…
Geodesic currents on closed hyperbolic surfaces are measures on the unit tangent bundle invariant under geodesic flow and orientation reversal. Every geodesic current induces a dual function on curves via the geometric intersection pairing.…