Related papers: Geodesic complexity of a tetrahedron
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…
Geodesic loops on polyhedra were studied only for Euclidean space and it was known that there are no simple geodesic loops on regular tetrahedra. Here we prove that: 1) On the spherical space, there are no simple geodesic loops on…
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive…
In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
We prove that every tetrahedron T has a simple, closed quasigeodesic that passes through three vertices of T. Equivalently, every T has a face whose "exterior angles" are at most pi.
We use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.
We define the notion of near geodesic between points of a metric space when no geodesic exists, and use this to extend Recio-Mitter's notion of geodesic complexity to non-geodesic spaces. This has potential application to topological…
The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in…
We determine (non-necessarily convex) polyhedra having simple dense geodesics.
We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…
In this survey results on the behavior of simple closed geodesics on regular tetrahedra in three-dimensional spaces of constant curvature are presented.
We show that a natural complexification and a mild generalization of the idea of completeness guarantee geodesic completeness of Clifton-Pohl torus; we explicitely compute all of its geodesics.
In this paper we present a necessary conditions, that simple close geodesics on regular tetrahedra in the 3-dimensional hyperbolic space must satisfy. Furthermore, we explicitly describe three classes of simple closed geodesics on regular…
Pogorelov proved in 1949 that every every convex polyhedron has at least three simple closed quasigeodesics. Whereas a geodesic has exactly pi surface angle to either side at each point, a quasigeodesic has at most pi surface angle to…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…
The geodesic complexity of a metric space X is the smallest k for which there is a partition of X x X into ENRs E_0,...,E_k on each of which there is a continuous choice of minimal geodesic sigma(x_0,x_1) from x_0 to x_1. We prove that the…
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…