Related papers: Geodesic Spanners for Points on a Polyhedral Terra…
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…
We give a new proof of McShane's classification of simple cuspidal geodesics, using simple equivariant methods in the hyperbolic plane.
Our aim in this paper is to construct a numerical algorithm using Taylor expansion of exponential map to find geodesic joining two points on a 2-dimensional surface for which a Riemannian metric is defined
There are several ways of a construction of a boundary of a symmetric space using pencils of geodesics: the Karpelevich boundary, the visibility boundary, the associahedral boundary, and the sea urchin. We give explicit descriptions of…
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.
We determine (non-necessarily convex) polyhedra having simple dense geodesics.
We classify parallel and totally geodesic hypersurfaces of the relevant class of G\"odel-type spacetimes, with particular regard to the homogeneous examples.
We show that if a cusped hyperbolic manifold is Platonic, i.e., can be decomposed into isometric Platonic solids, it can also be decomposed into geodesic ideal tetrahedra.
We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be…
Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…
We discuss self-crossing patterns of closed geodesics on a convex surface.
In this article, we investigate the problem of counting totally geodesic surfaces in the complement of hyperbolic knots with at most 9 crossings. Adapting previous counting techniques of boundary slope and intersection, we establish…
We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface is allowed to assume a general mixture of boundary…
Let X be a tree of proper geodesic spaces with edge spaces strongly contracting and uniformly separated from each other by a number depending on the contraction function of edge spaces. Then we prove that the strongly contracting geodesics…
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…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving…
A geodesic cycle is a closed curve that connects finitely many points along geodesics. We study geodesic cycles on the sphere in regard to their role in equal-weight quadrature rules and approximation.