English
Related papers

Related papers: Covering Folded Shapes

200 papers

Braided embeddings are embeddings to a product disc bundle so the projection to the first factor is a branched cover. In this paper, we study which branched covers lift to braided embeddings, which is a generalization of the Borsuk-Ulam…

Geometric Topology · Mathematics 2021-04-09 Sudipta Kolay

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

Combinatorics · Mathematics 2025-08-28 Chaya Keller , Micha A. Perles

Origami crease patterns are folding paths that transform flat sheets into spatial objects. Origami patterns with a single degree of freedom (DOF) have creases that fold simultaneously. More often, several substeps are required to…

Computational Engineering, Finance, and Science · Computer Science 2020-06-11 Yucai Hu , Haiyi Liang

In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…

Differential Geometry · Mathematics 2017-04-20 Richard Schoen , Shing-Tung Yau

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…

Information Theory · Computer Science 2020-05-26 Andreas Lenz , Cyrus Rashtchian , Paul H. Siegel , Eitan Yaakobi

This article gives necessary and sufficient conditions for the formation of trapped surfaces in spherically symmetric initial data defined on a closed manifold. Such trapped surfaces surround a region in which there occurs an enhancement of…

General Relativity and Quantum Cosmology · Physics 2009-10-22 Edward Malec , Niall Ó Murchadha

Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More…

Geometric Topology · Mathematics 2013-01-21 J. Scott Carter , Seiichi Kamada

We review a certain problem on covering triangles in the plane. Equivalently, it can be viewed as a family of 'isobilliard' inequalities in convex shapes, and as a special case of Viterbo's conjecture in symplectic geometry. We give an…

Metric Geometry · Mathematics 2026-03-16 Alexey Balitskiy , Ivan Mitrofanov , Alexander Polyanskii

We develop some design examples for approximating a target surface at the final rigidly folded state of a developable quadrilateral creased paper, which is folded with a 1-DOF rigid folding motion from the planar state. The final rigidly…

Metric Geometry · Mathematics 2020-06-15 Zeyuan He , Simon D. Guest

We study the existence of geometrically controlled branched covering maps from $\mathbb R^3$ to open $3$-manifolds or to decomposition spaces $\mathbb S^3/G$, and from $\mathbb S^3/G$ to $\mathbb S^3$.

Complex Variables · Mathematics 2013-11-01 Pekka Pankka , Kai Rajala , Jang-Mei Wu

When folding a 3D object from a 2D material like paper, typically only an approximation of the original surface geometry is needed. Such an approximation can effectively be created by a (progressive) mesh simplification approach, e.g. using…

Graphics · Computer Science 2024-05-14 Lars Zawallich , Renato Pajarola

We give a thoroughful explanation of the general properties of different, general scales, corresponding to different (all possible) mathematical functions f(x), we mention and analyse many examples. These observations and statements might…

History and Overview · Mathematics 2017-06-13 Istvan Szalkai

Let X be a compact complex surface with a real foliation. If all leaves are compact complex curves, the foliation must be holomorphic.

Complex Variables · Mathematics 2007-05-23 Joerg Winkelmann

We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…

Combinatorics · Mathematics 2023-10-31 Francis Oger

Let $k$ be any field and $k^s$ its separable closure. Let $X$ be an affine variety over $k$ which is isomorphic to affine $n$-space over the field extension $k^s$. Then $X$ is isomorphic to affine $n$ space over $k$.

Algebraic Geometry · Mathematics 2007-05-23 S. Subramanian

Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…

Complex Variables · Mathematics 2016-07-22 Neil Strickland

We address the question of when a covering of the boundary of a surface can be extended to a covering of the surface (equivalently: when is there a branched cover with a prescribed monodromy). If such an extension is possible, when can the…

Geometric Topology · Mathematics 2014-02-26 Manfred Droste , Igor Rivin

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su