Related papers: Geodesic trajectories on regular polyhedra

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…

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.

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 consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…

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…

We study the structure of geodesics in the fractal random metric constructed by Kendall from a self-similar Poisson process of roads (i.e, lines with speed limits) in $\mathbb{R}^2$. In particular, we prove a conjecture of Kendall stating…

There are no known efficient algorithms to calculate distance in the one-skeleta of associahedra, a problem that is equivalent to finding rotation distance between rooted binary trees or the flip distance between polygonal triangulations.…

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…

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 prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

We consider the the intersections of the complex nodal set of the analytic continuation of an eigenfunction of the Laplacian on a real analytic surface with the complexification of a geodesic. We prove that if the geodesic flow is ergodic…

We establish the background for the study of geodesics on noncompact polygonal surfaces. For illustration, we study the recurrence of geodesics on $Z$-periodic polygonal surfaces. We prove, in particular, that almost all geodesics on a…

We investigate local and global properties of timelike geodesics in three static spherically symmetric spacetimes. These properties are of its own mathematical relevance and provide a solution of the physical `twin paradox' problem. The…

We study the geodesic complexity of the ordered and unordered configuration spaces of graphs in both the $\ell_1$ and $\ell_2$ metrics. We determine the geodesic complexity of the ordered two-point $\varepsilon$-configuration space of any…

We give a simple proof based on symmetries that there are no geodesics from a vertex to itself in the cube, tetrahedron, octahedron, and icosahedron.

We show that on any translation surface, if a regular point is contained in a simple closed geodesic, then it is contained in infinitely many simple closed geodesics, whose directions are dense in the unit circle. Moreover, the set of…

In 1962 Ore initiated the study of geodetic graphs. A graph is called geodetic if the shortest path between every pair of vertices is unique. In the subsequent years a wide range of papers appeared investigating their peculiar properties.…

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…