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

We are interested in the naive problem whether we can move a solid object in a solid box or not. We restrict move to rotation. In the case we can, the centre and the ``direction'' of rotation may be restricted. Simplifying, we consider…

Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

In the present paper we give a historical account -ranging from classical to modern results- of the problem of rolling two Riemannian manifolds one on the other, with the restrictions that they cannot instantaneously slip or spin one with…

A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…

Predicting the large-amplitude deformations of thin elastic sheets is difficult due to the complications of self-contact, geometric nonlinearities, and a multitude of low-lying energy states. We study a simple two-dimensional setting where…

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…

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…

As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…

Many three dimensional manifolds are two-fold branched covers of the three dimensional sphere. However, there are some that are not. This paper includes exposition about two-fold branched covers and many examples. It shows that there are…

We survey results on the foldability of flat origami models. The main topics are the question of when a given crease pattern can fold flat, the combinatorics of mountain and valley creases, and counting how many ways a given crease pattern…

Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…

We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…

We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in…

We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…