Related papers: On Folding a Polygon to a Polyhedron
Polyfold theory was developed by Hofer-Wysocki-Zehnder by finding commonalities in the analytic framework for a variety of geometric elliptic PDEs, in particular moduli spaces of pseudoholomorphic curves. It aims to systematically address…
We are introducing a general framework for the construction of polyhedra and simplicial comlexes that are {\em bifoldable}, i.e. foldable into two two different planes. This vastly generalizes Origami folds known as the Miura pattern, the…
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…
Inspired by the allure of additive fabrication, we pose the problem of origami design from a new perspective: how can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve…
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is…
We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…
We notice a remarkable connection between Bazhanov-Sergeev solution of Zamolodchikov tetrahedron equation and certain well-known cluster algebra expression. The tetrahedron transformation is then identified with a sequence of four…
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…
The aim of this article is to give practicing teachers an overview about the theory behind paperfolding, it is my qualifying thesis(Zulassungsarbeit) as a teacher in Germany. It is a survey about the relations between paperfolding and…
Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…
The paper presents a proof of the Hodge Riemann relations for the combinatorial intersection cohomology of a polytope, as fist given by K.Karu, in terms of geometric operations on polytopes.
We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…
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…
The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.
We establish a connection between multiple polylogarithms on a torus and the Steinberg module of $\mathbb{Q}$, and show that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function…
Rohatgi and the author recently proved a shuffling theorem for lozenge tilings of `doubly-dented hexagons' (arXiv:1905.08311). The theorem can be considered as a hybrid between two classical theorems in the enumeration of tilings:…
We devise a polynomial-time algorithm for partitioning a simple polygon $P$ into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint,…
We study polygon equations and their connections to simplex equations, which generalize the pentagon and Yang--Baxter equations, respectively. First, we show that certain "commutative" pairs of solutions of (dual) polygon equations give…
We define $G$-symmetric polygonal systems of similarities and study the properties of symmetric dendrites, which appear as their attractors. This allows us to find the conditions under which the attractor of a zipper becomes a dendrite.
We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by…