Related papers: Rules for Folding Polyminoes from One Level to Two…

In this paper, we will show methods to interpret some rigid origami with higher degree vertices as the limit case of structures with degree-4 supplementary angle vertices. The interpretation is based on separating each crease into two…

Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…

Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…

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…

We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can be achieved by algorithms that use…

In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…

We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…

Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so…

A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…

The folding of paper, hide, and woven fabric has been used for millennia to achieve enhanced articulation, curvature, and visual appeal for intrinsically flat, two-dimensional materials. For graphene, an ideal two-dimensional material,…

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

In this paper we consider developable surfaces which are isometric to planar domains and which are piecewise differentiable, exhibiting folds along curves. The paper revolves around the longstanding problem of existence of the so-called…

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…

As a continuation of a previous paper (arXiv:2303.05769 [nlin.CD]), we introduce examples of H\'enon-type mappings that exhibit new horseshoe topologies in three and four dimensional spaces that are otherwise impossible in two dimensions.

This paper compares notions of double sliceness for links. The main result is to show that a large family of 2-component Montesinos links are not strongly doubly slice despite being weakly doubly slice and having doubly slice components.…

This paper investigates the motion of falling leaves through modeling using papers and the corresponding data collected from more than four thousands experiments. Two series of experiments were designed in order to study the relationship…

We study the scaling properties of forced folding of thin materials of different geometry. The scaling relations implying the topological crossovers from the folding of threedimensional plates to the folding of two-dimensional sheets, and…