Related papers: Simple closed geodesics on regular spherical polyh…
Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…
An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2\pi/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of…
Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…
We classify generic coadjoint orbits for symplectomorphism groups of compact symplectic surfaces with or without boundary. We also classify simple Morse functions on such surfaces up to a symplectomorphism.
We prove the existence of Alexandrov embedded closed magnetic geodesics on closed hyperbolic surfaces. Closed magnetic geodesics correspond to closed curves with prescribed geodesic curvature.
In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.
It is shown that the Jacobi problem of geodesics on ellipsoid may be reduced to more simple one, namely to the special case of the Clebsch problem. The last one may be solved directly by using Weber's approach in terms of multi-dimensional…
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…
Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the…
Sol LeWitt famously enumerated all the incomplete open cubes, finding 122 of these connected, non-planar subsets of the edges of the cube. Since then, while several projects have revisited the cube enumeration, no such enumeration has been…
If all prime closed geodesics on $(S^n,F)$ with an irreversible Finsler metric $F$ are irrationally elliptic, there exist either exactly $2\left[\frac{n+1}{2}\right]$ or infinitely many distinct closed geodesics. As an application, we show…
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,…
Fix a smooth closed manifold $M$. Let $R_M$ denote the space of all pairs $(g,L)$ such that $g$ is a $C^3$ Riemannian metric on $M$ and the real number $L$ is not the length of any closed $g$-geodesics. A locally constant geodesic count…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…
The standard conformal compactification of Euclidean space is the round sphere. We use conformal geodesics to give an elementary proof that this is the only possible conformal compactification.
We construct a smooth symmetric compactification of the space of all labeled tetrahedra in P^3.
We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on…
The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…
In this paper, we consider enumeration of geodesics on a polyhedron, where a geodesic means locally-shortest path between two points. Particularly, we consider the following preprocessing problem: given a point $s$ on a polyhedral surface…