English
Related papers

Related papers: Edge-Unfolding Nearly Flat Convex Caps

200 papers

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…

Combinatorics · Mathematics 2025-09-15 Asaf Ferber , Michael Krivelevich , Marcelo Sales , Wojciech Samotij

Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…

Combinatorics · Mathematics 2019-07-23 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

Combinatorics · Mathematics 2025-12-19 Giulia Codenotti , Roberto Riccardi , Lorenzo Venturello

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Combinatorics · Mathematics 2026-03-17 Anthony Meunier , Lhouari Nourine , Simon Vilmin

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy

Every polygon $P$ can be companioned by a cap polygon $\hat P$ such that $P$ and $\hat P$ serve as two parts of the boundary surface of a polyhedron $V$. Pairs of vertices on $P$ and $\hat P$ are identified successively to become vertices…

Computational Geometry · Computer Science 2024-11-27 Mercedes Sandu , Shuyi Weng , Jade Zhang

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

We first study $f$-biharmonicity of totally umbilical hypersurfaces in a generic Riemannian manifold and then prove that any totally umbilical proper $f$-biharmonic hypersurface in a nonpositively curved manifold has to be noncompact. We…

Differential Geometry · Mathematics 2024-10-29 Ze-Ping Wang , Li-Hua Qin , Xue-Yi Chen

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov

We investigate an extended version of the stable Andrews-Curtis transformations, referred to as EAC transformations, and compare it with a notion of equivalence in a family of $3$-manifolds with boundary, called the {\emph{simple balanced…

Geometric Topology · Mathematics 2021-10-25 Neda Bagherifard

An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…

Metric Geometry · Mathematics 2020-12-01 İsmail Sağlam

An affine manifold is a manifold with an affine structure, i.e. a torsion-free flat affine connection. We show that the universal cover of a closed affine 3-manifold $M$ with holonomy group of shrinkable dimension (or discompacit\'e in…

dg-ga · Mathematics 2008-02-03 Suhyoung Choi

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…

Computational Geometry · Computer Science 2024-05-28 Christian Amend , Tom Goertzen

For appropriately values of $H$, we obtain an area estimate for a complete non-compact $H$-surface of finite topology and finite area, embedded in a three-manifold of negative curvature. Moreover, in the case of equality and under…

Differential Geometry · Mathematics 2017-06-29 Vanderson Lima

There is a conjecture that a complete Riemannian 3-manifold with bounded sectional curvature, and pointwise pinched nonnegative Ricci curvature, must be flat or compact. We show that this is true when the negative part (if any) of the…

Differential Geometry · Mathematics 2023-02-21 John Lott

We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…

Combinatorics · Mathematics 2020-07-24 Diego Nicodemos , Matěj Stehlík

In a quadruply imaged lens system the angular distribution of images around the lens center is completely described by three relative angles. We show empirically that in the 3D space of these angles, spanning 180 x 180 x 90 degrees, quads…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-03 Addishiwot G. Woldesenbet , Liliya L. R. Williams

It is classically known that complete flat surfaces in Euclidean 3-space are cylinders over space curves. This implies that the study of global behaviour of flat surfaces requires the study of singular points as well. If a flat surface $f$…

Differential Geometry · Mathematics 2008-12-25 Satoko Murata , Masaaki Umehara

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

Combinatorics · Mathematics 2023-03-07 Guillermo Pineda-Villavicencio , Julien Ugon