English
Related papers

Related papers: Closed simple geodesics on a polyhedron

200 papers

It is proved, that if M is a connected, complete submanifold of a complex space form N and each geodesic of M lies in an 1-dimensional totally geodesic complex submanifold of N, then M is totally geodesic in N and is a real space form or a…

Differential Geometry · Mathematics 2009-12-22 Ognian Kassabov

Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with…

Computational Geometry · Computer Science 2018-07-27 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman

We give a Morse-theoretic characterization of simple closed geodesics on Riemannian $2$-spheres. On any Riemannian $2$-sphere endowed with a generic metric, we show there exists a simple closed geodesic with Morse index $1$, $2$ and $3$. In…

Differential Geometry · Mathematics 2023-04-13 Dongyeong Ko

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

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

Kokotsakis studied the following problem in 1932: Given is a rigid closed polygonal line (planar or non-planar), which is surrounded by a polyhedral strip, where at each polygon vertex three faces meet. Determine the geometries of these…

Computational Geometry · Computer Science 2022-02-17 Georg Nawratil

We prove that any complete (and possibly non-compact) Riemannian manifold $M$ possesses infinitely many closed geodesics provided its free loop space has unbounded Betti numbers in degrees larger than the dimension of $M$, and there are no…

Differential Geometry · Mathematics 2017-03-21 Luca Asselle , Marco Mazzucchelli

A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…

Metric Geometry · Mathematics 2007-05-23 Martin Grötschel , Martin Henk

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…

Metric Geometry · Mathematics 2021-10-29 Frank Göring , Martin Winter

We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m <= 6.

Geometric Topology · Mathematics 2007-05-23 Jean-Claude Hausmann

We construct five types of polyhedra by generalizing the description of Bricard octahedra and applying the generalizations to polyhedral suspensions. The resulting polyhedra are flexible, are of genus 0, exhibit self-intersections, have…

Metric Geometry · Mathematics 2012-06-13 Gerald D. Nelson

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

In this paper, we prove that for every Finsler $n$-sphere $(S^n, F)$ for $n\ge 3$ with reversibility $\lambda$ and flag curvature $K$ satisfying $(\frac{\lambda}{\lambda+1})^2<K\le 1$, either there exist infinitely many prime closed…

Differential Geometry · Mathematics 2008-03-19 Wei Wang

We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where…

Computational Geometry · Computer Science 2021-08-30 Patrizio Angelini , Philipp Kindermann , Andre Löffler , Lena Schlipf , Antonios Symvonis

The monostatic property of polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in a focus of research ever since Conway and Guy \cite{Conway} published the proof of the existence of the…

Metric Geometry · Mathematics 2023-04-17 Gergő Almádi , Robert J. MacG. Dawson , Gábor Domokos , Krisztina Regős

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…

Geometric Topology · Mathematics 2016-07-20 Jenya Sapir

Let S be a compact surface of genus >1, and g be a metric on S of constant curvature K\in\{-1,0,1\} with conical singularities of negative singular curvature. When K=1 we add the condition that the lengths of the contractible geodesics are…

Differential Geometry · Mathematics 2009-02-27 François Fillastre

Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which…

Computational Geometry · Computer Science 2019-08-21 Joseph O'Rourke
‹ Prev 1 8 9 10 Next ›