English
Related papers

Related papers: Total curvature and spiralling shortest paths

200 papers

The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.…

Differential Geometry · Mathematics 2014-03-10 Benoît Loisel , Pascal Romon

We give a lower bound for the length of a non-trivial geodesic loop on a simply-connected and compact manifold of even dimension with a non-reversible Finsler metric of positive flag curvature. Harris and Paternain use this estimate in…

Differential Geometry · Mathematics 2007-06-01 Hans-Bert Rademacher

Gromov conjectured that the total mean curvature of the boundary of a compact Riemannian manifold can be estimated from above by a constant depending only on the boundary metric and on a lower bound for the scalar curvature of the fill-in.…

Differential Geometry · Mathematics 2026-02-10 Christian Baer

We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x\in \mathbb{R}^n:\, A x =…

Optimization and Control · Mathematics 2026-02-12 Bento Natura

Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999…

Computational Geometry · Computer Science 2016-09-05 Prosenjit Bose , Paz Carmi , Mirela Damian , Jean-Lou De Carufel , Darryl Hill , Anil Maheshwari , Yuyang Liu , Michiel Smid

We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…

Statistical Mechanics · Physics 2012-12-10 Julien Randon-Furling

A drawing of a graph in the plane is a thrackle if every pair of edges intersects exactly once, either at a common vertex or at a proper crossing. Conway's conjecture states that a thrackle has at most as many edges as vertices. In this…

Discrete Mathematics · Computer Science 2019-09-18 Oswin Aichholzer , Linda Kleist , Boris Klemz , Felix Schröder , Birgit Vogtenhuber

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 conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

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 consider properties of the total absolute geodesic curvature functional on circle immersions into a Riemann surface. In particular, we study its behavior under regular homotopies, its infima in regular homotopy classes, and the homotopy…

Geometric Topology · Mathematics 2016-08-08 Tobias Ekholm

The goal of this article is to study minimal surfaces in $\mathbb{M}^2 \times \mathbb{R}$ having finite total curvature, where $\mathbb{M}^2$ is a Hadamard manifold. The main result gives a formula to compute the total curvature in terms of…

Differential Geometry · Mathematics 2019-01-24 Rafael Ponte

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

We give lower bound on the number of periodic billiard trajectories inside a generic smooth strictly convex closed surface in 3-space: for odd n, there are at least 2(n-1) such trajectories. We apply a topological approach based on the…

Differential Geometry · Mathematics 2007-05-23 Michael Farber , Serge Tabachnikov

We consider the mean curvature flow of compact convex surfaces in Euclidean $3$-space with free boundary lying on an arbitrary convex barrier surface with bounded geometry. When the initial surface is sufficiently convex, depending only on…

Analysis of PDEs · Mathematics 2020-01-07 Sven Hirsch , Martin Li

Given $ n \geq 2 $ and $ k \in \{2, \ldots , n\} $, we study the asymptotic behaviour of sequences of bounded $C^2$-domains of finite total curvature in $ \mathbb{R}^{n+1} $ converging in volume and perimeter, and with the $ k $-th mean…

Differential Geometry · Mathematics 2023-08-23 Mario Santilli

Pogorelov's rigidity theorem states that a compact convex body in the hyperbolic 3-space is determined up to isometry by the intrinsic path metric on its boundary. The main result of this paper addresses a rigidity problem for non-compact…

Geometric Topology · Mathematics 2026-03-02 Feng Luo , Yanwen Luo , Zhenghao Rao

We find the minimal value of the length in de Sitter space of closed space-like curves with non-vanishing non-space-like geodesic curvature vector. These curves are in correspondence with closed almost-regular canal surfaces, and their…

Differential Geometry · Mathematics 2011-08-12 Rémi Langevin , Gil Solanes

We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…

Metric Geometry · Mathematics 2025-06-09 Isaac Kulp , Charlotte Ochanine , Logan Richard , Leonel Robert , Scott Whitman

We investigate for the first time the curve shortening flow in the metric-affine plane and prove that under simple geometric condition it shrinks a closed convex curve to a "round point" in finite time. This generalizes the classical result…

Differential Geometry · Mathematics 2020-03-24 Vladimir Rovenski
‹ Prev 1 8 9 10 Next ›