Related papers: Covering Folded Shapes
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Flaps can be detached from a thin film glued on a solid substrate by tearing and peeling. For flat substrates, it has been shown that these flaps spontaneously narrow and collapse in pointy triangular shapes. Here we show that various…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
An origami manifold is a manifold equipped with a closed 2-form which is symplectic except on a hypersurface where it is like the pullback of a symplectic form by a folding map and its kernel fibrates with oriented circle fibers over a…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…
The principles behind the sharp, singular structures in a crumpled sheet are well understood. Here we discuss more general ways of exploiting such sharp structures to control the shape of a sheet by deforming or forcing it elsewhere. Often,…
Starting with a flat sheet of paper, points can be constructed as the intersection of two folds. The set of constructible points clearly depends on which folds are admissible. In this paper, we study the situation where a fold is admissible…
Folding paper along curves leads to spatial structures that have curved surfaces meeting at spatial creases, defined as curve-fold origami. In this work, we provide an Eulerian framework focusing on the mechanics of arbitrary curve-fold…
In this paper, we show that the total area of two distinct surfaces with Gaussian curvature equal to 1, which are also conformal to the Euclidean unit disk with the same conformal factor on the boundary, must be at least 4{\pi}. In other…
We discuss well known geometric constructions via paper-folding. The note is written primary for school students.
Let $X$ be an $(n+1)$-dimensional manifold, $\Delta$ be a one-dimensional foliation on $X$, and $p: X \to X / \Delta$ be a quotient map. We will say that a leaf $\omega$ of $\Delta$ is special whenever the space of leaves $X / \Delta$ is…
A topological space is called self-covering if it is a nontrivial cover of itself. We prove that, under mild assumptions, a closed self-covering manifold with an abelian fundamental group fibers over a torus in various senses. As a…
We construct flat metrics in a given conformal class with prescribed singularities of real orders at marked points of a closed real surface. The singularities can be small conical, cylindrical, and large conical with possible translation…
In this paper, we study confoliations in dimensions higher than three mostly from the perspective of symplectic fillability. Our main result is that Massot-Niederkr\"uger-Wendl's bordered Legendrian open book, an object that obstructs the…
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…
Kirigami, the Japanese art of paper cutting, has recently enabled the design of stretchable mechanical metamaterials that can be easily realized by embedding arrays of periodic cuts into an elastic sheet. Here, we exploit kirigami…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…