Related papers: Construction of a regular hendecagon by two-fold o…
In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…
What is the smallest number of pieces that you can cut an n-sided regular polygon into so that the pieces can be rearranged to form a rectangle? Call it r(n). The rectangle may have any proportions you wish, as long as it is a rectangle.…
Kirigami is the art of cutting paper to make it articulated and deployable, allowing for it to be shaped into complex two and three-dimensional geometries. The mechanical response of a kirigami sheet when it is pulled at its ends is enabled…
In this paper we explore and develop a simple set of rules that apply to cutting, pasting, and folding honeycomb lattices. We consider origami-like structures that are extinsically flat away from zero-dimensional sources of Gaussian…
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,…
In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative…
Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_\alpha(p)$ be the line in the complex plane through $p$ with angle $\alpha$ (with respect to the real axis). Given…
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to…
Origami structures are characterized by a network of folds and vertices joining unbendable plates. For applications to mechanical design and self-folding structures, it is essential to understand the interplay between the set of folds in…
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…
Here we describe an ultra-low-cost origami-based approach for large-scale manufacturing of microscopes, specifically demonstrating brightfield, darkfield, and fluorescence microscopes. Merging principles of optical design with origami…
The art and science of folding intricate three-dimensional structures out of paper has occupied artists, designers, engineers, and mathematicians for decades, culminating in the design of deployable structures and mechanical metamaterials.…
Let $S_g$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_g$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
Until recently, the simplest known flexible polyhedron was Steffen's polyhedron on nine vertices. However, in 2024, an embedded flexible polyhedron on eight vertices was announced. It attains the known lower bound for the number of…
We characterize the phase-space of all Helical Miura Origami. These structures are obtained by taking a partially folded Miura parallelogram as the unit cell, applying a generic helical or rod group to the cell, and characterizing all the…
This paper gives one set of axioms for origami constructions, and describes the set of constructible points under these axioms. The determination of the set of cunstructible points for this particular set of axioms is related to Hilbert's…
The aim of this note is to introduce fastest new general methods for the construction of double and single even order magic squares. As in [5], the method for double even order magic squares is fairly straight-forward but some adjustments…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the…