English
Related papers

Related papers: Polyhedra with simple dense geodesics

200 papers

We show that on any translation surface, if a regular point is contained in a simple closed geodesic, then it is contained in infinitely many simple closed geodesics, whose directions are dense in the unit circle. Moreover, the set of…

Geometric Topology · Mathematics 2019-08-22 Duc-Manh Nguyen , Huiping Pan , Weixu Su

This paper is an introduction to Coxeter polyhedra in spherical, Euclidean, and hyperbolic geometries. It consists of essentially two parts that could be read independently. In the first we introduce non-obtuse polyhedra in the spherical,…

Geometric Topology · Mathematics 2026-05-04 Bruno Martelli

In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…

Analysis of PDEs · Mathematics 2023-10-10 Luca Rondi

For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…

Differential Geometry · Mathematics 2024-10-30 Herng Yi Cheng

We prove that, both in the hyperbolic and spherical 3-spaces, there exist nonconvex compact boundary-free polyhedral surfaces without selfintersections which admit nontrivial continuous deformations preserving all dihedral angles and study…

Metric Geometry · Mathematics 2014-09-10 Victor Alexandrov

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…

Differential Geometry · Mathematics 2023-03-24 Misha Gromov

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

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 consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

We prove that geodesic balls centered at some base point are isoperimetric in the real hyperbolic space $H_{\mathbb R}^n$ endowed with a smooth, radial, strictly log-convex density on the volume and perimeter. This is an analogue of the…

Differential Geometry · Mathematics 2022-09-26 Lauro Silini

We prove that for a Baire-generic Riemannian metric on a closed smooth manifold of dimension greater than or equal 3, the union of stationary geodesic nets that are not closed geodesics forms a dense set. This result confirms a…

Differential Geometry · Mathematics 2025-10-06 Talant Talipov

We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q "lives on a cone" to both sides; it includes simple,…

Computational Geometry · Computer Science 2012-05-07 Jin-ichi Itoh , Joseph O'Rourke , Costin Vilcu

We characterise Newton polytopes of nondegenerate quadratic forms and Newton polyhedra of Morse singularities.

Combinatorics · Mathematics 2019-10-15 Aliaksandr Yuran

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

We prove the existence of multiple closed geodesics on non-compact cylindrica manifolds.

Analysis of PDEs · Mathematics 2007-05-23 Simone Secchi

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…

Metric Geometry · Mathematics 2025-09-12 Florian Frick , Pranav Rajbhandari

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

We study the existence of simple closed geodesics on most (in the sense of Baire category) Alexandrov surfaces with curvature bounded below, compact and without boundary. We show that it depends on both the curvature bound and the topology…

Metric Geometry · Mathematics 2013-11-20 Joël Rouyer , Costin Vîlcu