English
Related papers

Related papers: Edge-Unfolding Nearly Flat Convex Caps

200 papers

In [AMW], it is proved that if a compact $3$-manifold has positive Ricci curvature and strictly convex boundary, then this manifold is diffeomorphic to the standard $3$-dimensional Euclidean disk. In this paper, we prove its…

Differential Geometry · Mathematics 2021-01-01 Yongjia Zhang

We show that in Cartan-Hadamard manifolds $M^n$, $n\geq 3$, closed infinitesimally convex hypersurfaces $\Gamma$ bound convex flat regions, if curvature of $M^n$ vanishes on tangent planes of $\Gamma$. This encompasses…

Differential Geometry · Mathematics 2025-10-16 Mohammad Ghomi

We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…

Metric Geometry · Mathematics 2020-04-08 Bogdan Grechuk , Sittichoke Som-am

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Computer Vision and Pattern Recognition · Computer Science 2020-04-14 Boyang Deng , Kyle Genova , Soroosh Yazdani , Sofien Bouaziz , Geoffrey Hinton , Andrea Tagliasacchi

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Differential Geometry · Mathematics 2024-01-26 Brian White

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

Computational Geometry · Computer Science 2023-06-02 Hugo Akitaya , Josh Brunner , Erik D. Demaine , Dylan Hendrickson , Victor Luo , Andy Tockman

When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of…

Computational Geometry · Computer Science 2018-03-20 Zachary Abel , Erik D. Demaine , Martin L. Demaine , David Eppstein , Anna Lubiw , Ryuhei Uehara

In this paper, firstly, for some $4n$-dimensional almost complex manifolds $M_{i}, ~1\le i \le \alpha$, we prove that $\left(\sharp_{i=1}^{\alpha} M_{i}\right) \sharp (\alpha{-}1) \mathbb{C} P^{2n}$ must admits an almost complex structure,…

Differential Geometry · Mathematics 2018-08-27 Huijun Yang

A Riemannian manifold is called almost positively curved if the set of points for which all $2$-planes have positive sectional curvature is open and dense. We find three new examples of almost positively curved manifolds: $Sp(3)/Sp(1)^2$,…

Differential Geometry · Mathematics 2020-08-07 Jason DeVito

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

In this paper we present a three-dimensional discrete model governing the deformation of a viral capsid, modelled as a regular icosahedron and subjected not to cross a given flat rigid surface on which it initially lies in correspondence of…

Analysis of PDEs · Mathematics 2022-04-15 Paolo Piersanti , Kristen White , Bogdan Dragnea , Roger Temam

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

Start with Gott (2019)'s envelope polyhedron (Squares-4 around a point): a unit cube missing its top and bottom faces. Stretch by a factor of 2 in the vertical direction so its sides become (2x1 unit) rectangles. This has 8 faces (4…

Metric Geometry · Mathematics 2020-06-23 J. Richard Gott , Robert J. Vanderbei

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

Atomic and Molecular Clusters · Physics 2022-09-20 KLaus E. Hermann

We define a 2-normal surface to be one which intersects every 3-simplex of a triangulated 3-manifold in normal triangles and quadrilaterals, with one or two exceptions. The possible exceptions are a pair of octagons, a pair of unknotted…

Geometric Topology · Mathematics 2009-09-29 David Bachman

In this work, we show that complete non-compact manifolds with non-negative Ricci curvature, Euclidean volume growth and sufficiently small curvature concentration are necessarily flat Euclidean space.

Differential Geometry · Mathematics 2023-12-14 Pak-Yeung Chan , Man-Chun Lee

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…

Geometric Topology · Mathematics 2020-11-03 Nikolay Bogachev , Alexander Kolpakov

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

We prove that the boundary of the trapped region in an asymptotically Euclidean Riemannian manifold of dimension at least 3 is a stable smooth minimal hypersurface except for a singular set of codimension at least 8.

Differential Geometry · Mathematics 2018-09-05 Eric Larsson

We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…

Metric Geometry · Mathematics 2019-05-02 Bogdan Grechuk , Sittichoke Som-Am
‹ Prev 1 8 9 10 Next ›