Related papers: Quasigeodesics on the Cube
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 show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. We prove a new isoperimetric inequality for 2-spheres with pinched curvature; this allows us to…
Let S be the boundary of a handlebody M. We prove that the set of curves in S that are boundaries of disks in M, considered as a subset of the complex of curves of S, is quasi-convex.
We prove the existence of multiple closed geodesics on non-compact cylindrica manifolds.
In this article, we study subloci of solvable curves in $\mathcal{M}_g$ which are contained in either a K3-surface or a quadric or a cubic surface. We give a bound on the dimension of such subloci. In the case of complete intersection genus…
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…
There are three complete plane geometries of constant curvature: spherical, Euclidean and hyperbolic geometry. We explain how a closed oriented surface can carry a geometry which locally looks like one of these. Focussing on the hyperbolic…
We prove that, if a closed geodesic $\Gamma$ on a complete finite type hyperbolic surface has at least 2 self-intersections, then the length of $\Gamma$ has an lower bound $2\log(5+2\sqrt6)$, and the lower bound is sharp, attained on a…
In the study of immersed surfaces of constant positive extrinsic curvature in space-forms, it is natural to substitute completeness for a weaker property, which we here call quasicompleteness. We determine the global geometry of such…
In this paper we prove some geometric inequalities for closed surfaces in Euclidean three-space. Motivated by Gage's inequality for convex curves, we first verify that for convex surfaces the Willmore energy is bounded below by some…
In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $L/k$, where $L$ is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show…
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
This paper focuses on using the theory of bicorn curves in the context of closed surfaces to understand hyperbolic phenomena of the curve graphs of those surfaces. We prove that the curve graph of any closed surface is 15-hyperbolic with…
We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…
This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…
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…
It is shown that there exist non-singular cubic surfaces in CP^3 containing 5 twistor lines. This is the maximum number of twistor fibres that a non-singular cubic can contain. Cubic surfaces in CP^3 with 5 twistor lines are classified up…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…