English
Related papers

Related papers: Edge-Unfolding Nearly Flat Convex Caps

200 papers

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

A (flat) affine $3$-manifold is a $3$-manifold with an atlas of charts to an affine space $\mathbb{R}^3$ with transition maps in the affine transformation group $\mathrm{Aff}(\mathbb{R}^3)$. We will show that a connected closed affine…

Geometric Topology · Mathematics 2018-08-24 Suhyoung Choi

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

We show that a closed piecewise-linear hypersurface immersed in $R^n$ ($n\ge 3$) is the boundary of a convex body if and only if every point in the interior of each $(n-3)$-face has a neighborhood that lies on the boundary of some convex…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

Metric Geometry · Mathematics 2007-05-23 Konstantin Rybnikov

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

We study a notion of strict pseudoconvexity in the context of topologically (often unsmoothably) embedded 3-manifolds in complex surfaces. Topologically pseudoconvex (TPC) 3-manifolds behave similarly to their smooth analogues, cutting out…

Geometric Topology · Mathematics 2023-04-18 Robert E. Gompf

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Metric Geometry · Mathematics 2025-09-18 Keith Ball , Károly J. Böröczky , Assaf Naor

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping "volcano unfolding." These unfoldings keep the base…

Computational Geometry · Computer Science 2015-03-12 Nadia Benbernou , Patricia Cahn , Joseph O'Rourke

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

Combinatorics · Mathematics 2026-05-18 Riccardo W. Maffucci

A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…

Computational Geometry · Computer Science 2025-10-21 Erik D. Demaine , Adam C. Hesterberg , Jason S. Ku

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

Computational Geometry · Computer Science 2015-05-13 Alexander Pilz

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

Computational Geometry · Computer Science 2020-08-17 Uli Wagner , Emo Welzl

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

Differential Geometry · Mathematics 2024-01-02 Ramazan Yol

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…

Differential Geometry · Mathematics 2007-05-23 Simon P Morgan

A polyhedral surface~$\mathcal{C}$ in $\mathbb{R}^3$ with convex polygons as faces is a side-contact representation of a graph~$G$ if there is a bijection between the vertices of $G$ and the faces of~$\mathcal{C}$ such that the polygons of…

Computational Geometry · Computer Science 2023-08-02 André Schulz