Related papers: Maximal origami flip graphs of flat-foldable verti…
Shape-morphing finds widespread utility, from the deployment of small stents and large solar sails to actuation and propulsion in soft robotics. Origami structures provide a template for shape-morphing, but rules for designing and folding…
We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of the…
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…
Non-Euclidean origami is a promising technique for designing multistable deployable structures folded from nonplanar developable surfaces. The impossibility of flat foldability inherent to non-Euclidean origami results in two disconnected…
We consider a problem in computational origami. Given a piece of paper as a convex polygon $P$ and a point $f$ located within, fold every point on a boundary of $P$ to $f$ and compute a region that is safe from folding, i.e., the region…
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 study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if…
Miura-ori is well-known for its capability of flatly folding a sheet of paper through a tessellated crease pattern made of repeating parallelograms. Many potential applications have been based on the Miura-ori and its primary variations.…
Origami is the art of paper folding, and it borrows its name from two Japanese words \emph{ori} and \emph{kami}. In Japanese, {ori} means folding, and the paper is called {kami}. While origami is just a hobby to most, there is a lot more to…
We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…
We develop a theoretical framework for rigid origami, and show how this framework can be used to connect rigid origami and results from cognate areas, such as the rigidity theory, graph theory, linkage folding and computer science. First,…
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…
Periodic origami patterns made with repeating unit cells of creases and panels bend and twist in complex ways. In principle, such soft modes of deformation admit a simplified asymptotic description in the limit of a large number of cells.…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
Self-folding origami has emerged as a tool to make functional objects in material science. The common idea is to pattern a sheet with creases and activate them to have the object fold spontaneously into a desired configuration. This article…
We survey more recent attempts at enumerating the number of mountain-valley assignments that allow a given crease pattern to locally fold flat. In particular, we solve this problem for square twist tessellations and generalize the method…
While the grasping capability of robotic grippers has shown significant development, the ability to manipulate objects within the hand is still limited. One explanation for this limitation is the lack of controlled contact variation between…
Let $G$ be a graph embedded on an orientable surface. Given a class ${\cal C}$ of facial circuits of $G$ as a forbidden class, we give a sufficient-necessary condition for that an $\alpha$-orientation (orientation with prescribed…
A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For trees on a set of points in convex position we study two…
We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…