Related papers: Covering Folded Shapes
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
A foundational result in origami mathematics is Kawasaki and Justin's simple, efficient characterization of flat foldability for unassigned single-vertex crease patterns (where each crease can fold mountain or valley) on flat material. This…
We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then making a single straight cut (at any angle). Along the way,…
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…
A folding of a branched cover of the 3-sphere that is branched over a knot is a continuous map of the cover into the product of the sphere with a disk that has the property that the projection onto the sphere factor induces the covering.…
We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper. In contrast, we show that the…
We prove that testing the flat foldability of an origami crease pattern (either labeled with mountain and valley folds, or unlabeled) is fixed-parameter tractable when parameterized by the ply of the flat-folded state and by the treewidth…
We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…
This paper deals with themes such as approximate counting/evaluation of the total number of flat-foldings for random origami diagrams, evaluation of the values averaged over various instances, obtaining forcing sets for general origami…
It is a story about the problem whether folding a square on the plane can increase its perimeter. The paper is written primary for school students.
We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…
Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
Self-folding origami, structures that are engineered flat to fold into targeted, three-dimensional shapes, have many potential engineering applications. Though significant effort in recent years has been devoted to designing fold patterns…
Many objects in nature and industry are wrapped in a thin sheet to enhance their chemical, mechanical, or optical properties. There are similarly a variety of methods for wrapping, from pressing a film onto a hard substrate, to using…
We discuss various problems regarding the structure of the foliation of some foliated submanifolds S of C^n, in particular Levi flat ones. As a general scheme, we suppose that S is bounded along a coordinate (or a subset of coordinates),…
Polyominoes have been the focus of many recreational and research investigations. In this article, the authors investigate whether a paper cutout of a polyomino can be folded to produce a second polyomino in the same shape as the original,…
Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats…
Given a sheet of paper and a prescribed folding of its boundary, is there a way to fold the paper's interior without stretching so that the boundary lines up with the prescribed boundary folding? For polygonal boundaries nonexpansively…