English
Related papers

Related papers: Quasigeodesics on the Cube

200 papers

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…

Metric Geometry · Mathematics 2022-03-10 Joseph O'Rourke , Costin Vilcu

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

Computational Geometry · Computer Science 2022-09-29 Jean Chartier , Arnaud de Mesmay

A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…

Computational Geometry · Computer Science 2025-10-21 Erik D. Demaine , Adam C. Hesterberg , Jason S. Ku

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.

Differential Geometry · Mathematics 2024-08-21 Darya Sukhorebska

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

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.

Metric Geometry · Mathematics 2022-02-10 Joseph O'Rourke

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…

Differential Geometry · Mathematics 2023-08-04 Alexander A. Borisenko , Vicente Miquel

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…

Metric Geometry · Mathematics 2023-12-19 Vladimir Yu. Protasov

On a regular tetrahedron in spherical space there exist the finite number of simple closed geodesics. For any pair of coprime integers $(p,q)$ it was found the numbers $\alpha_1$ and $\alpha_2$ depending on $p$, $q$ and satisfying the…

Metric Geometry · Mathematics 2021-10-27 Alexander A. Borisenko , Darya D. Sukhorebska

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…

Metric Geometry · Mathematics 2023-08-09 Donald M. Davis

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

Metric Geometry · Mathematics 2019-03-01 Nicholas Barvinok , Mohammad Ghomi

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…

Differential Geometry · Mathematics 2022-06-08 Ian M Adelstein , Benjamin Schmidt

Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…

Discrete Mathematics · Computer Science 2011-02-15 Joseph O'Rourke , Costin Vilcu

We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…

Geometric Topology · Mathematics 2017-02-21 Jenya Sapir

This article deals with the set of closed geodesics on complete finite type hyperbolic surfaces. For any non-negative integer $k$, we consider the set of closed geodesics that self-intersect at least $k$ times, and investigate those of…

Geometric Topology · Mathematics 2019-12-23 Thi Hanh Vo

It is unknown whether every polycube (polyhedron constructed by gluing cubes face-to-face) has an edge unfolding, that is, cuts along edges of the cubes that unfolds the polycube to a single nonoverlapping polygon in the plane. Here we…

Computational Geometry · Computer Science 2022-05-24 Erik D. Demaine , Martin L. Demaine , David Eppstein , Joseph O'Rourke

In this work we solve a couple of well known open problems related to the quasihyperbolic metric. In the case of planar domains, our first main result states that quasihyperbolic geodesics are unique in simply connected domains. As the…

Metric Geometry · Mathematics 2015-04-09 Hannes Luiro

We study closed geodesics on hyperbolic surfaces, and give bounds for their angles of intersection and self-intersection, and for the sides of the polygons that they form, depending only on the lengths of the geodesics

Geometric Topology · Mathematics 2019-05-28 Max Neumann-Coto , Peter Scott

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

Geometric Topology · Mathematics 2017-02-21 Jenya Sapir

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

Computational Geometry · Computer Science 2025-07-15 Mirela Damian , Henk Meijer
‹ Prev 1 2 3 10 Next ›