Related papers: Simple Closed Quasigeodesics on Tetrahedra

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…

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…

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…

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.

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…

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.

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…

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…

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…

We obtained a complete classification of simple closed geodesics on regular tetrahedra in Lobachevsky space. Also, we evaluated the number of simple closed geodesics of length not greater than $L$ and found the asymptotic of this number as…

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…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

In 1958, S. \'Swierczkowski proved that there cannot be a closed loop of congruent interior-disjoint regular tetrahedra that meet face-to-face. Such closed loops do exist for the other four regular polyhedra. It has been conjectured that,…

In this paper, we prove that if a quasi-Fuchsian 3-manifold $M$ contains a simple closed geodesic with complex length $\Lscr=l+i\theta$ such that $\theta/l\gg{}1$, then it contains at least two minimal surfaces which are incompressible in…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

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.

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…

We give the quasi--Euclidean classification of the maximal (with respect to the $f$--vector) alcoved polyhedra. The $f$--vector of these maximal convex bodies is $(20,30,12)$, so they are simple dodecahedra. We find eight quasi--Euclidean…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…