Related papers: Geodesic complexity for non-geodesic spaces
In this paper we generalize the discrete r-homotopy to the discrete (s, r)-homotopy. Then by this notion, we introduce the discrete motion planning for robots which can move discreetly. Moreover, in this case the number of motion planning,…
We provide an alternative, constructive proof that the collection $\mathcal{M}$ of isometry classes of compact metric spaces endowed with the Gromov-Hausdorff distance is a geodesic space. The core of our proof is a construction of explicit…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
We discuss whether it is possible to reconstruct a metric by its unparameterized geodesics, and how to do it effectively. We explain why this problem is interesting for general relativity. We show how to understand whether all curves from a…
The formalism for describing a metric and the corresponding scalar in terms of multipole moments has recently been developed for scalar-tensor theories. We take advantage of this formalism in order to obtain expressions for the observables…
We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…
In spaces of nonpositive curvature the existence of isometrically embedded flat (hyper)planes is often granted by apparently weaker conditions on large scales. We show that some such results remain valid for metric spaces with non-unique…
It has been observed that the very important motion planning problem of robotics mathematically speaking boils down to the problem of finding a section to the path-space fibration, raising the notion of topological complexity, as introduced…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative…
This note surveys basic topological properties of nonarchimedean analytic spaces, in the sense of Berkovich, including the recent tameness results of Hrushovski and Loeser. We also discuss interactions between the topology of nonarchimedean…
We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…
Robots sense, move and act in the physical world. It is therefore natural that algorithmic problems in robotics and automation have a geometric component, often central to the problem. Below we review ten challenging problems at the…
It is proved that the Gromov-Hausdorff metric on the space of compact metric spaces considered up to an isometry is strictly intrinsic, i.e., the corresponding metric space is geodesic. In other words, each two points of this space (each…
By a geodesic subspace of a metric space $X$ we mean a subset $A$ of $X$ such that any two points in $A$ can be connected by a geodesic in $A$. It is easy to check that a geodesic metric space $X$ is an $\mathbb{R}$-tree (that is, a…
For metric spaces with curvature less than or equal to x, x<0, it is shown that a recurrent geodesic can be approximated by closed geodesics. A counter example is provided for the converse.
We study the geodesics on an invariant surface of a three dimensional Riemannian manifold. The main results are: the characterization of geodesic orbits; a Clairaut's relation and its geometric interpretation in some remarkable three…
We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
This paper examines the issue of the existence and nature of time-like geodesics in asymptotically flat spacetimes and proposes a novel generalized topological criterion for the existence of time-like geodesics. Its validity is proved using…