Related papers: Infinite All-Layers Simple Foldability
Soft elastic sheets resting on rigid surfaces develop wrinkles, rucks, and folds due to the combined influence of elasticity, gravity, and contact interactions. Despite their ubiquity, the principles governing their morphology and…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
Lattices and their underlying symmetries play a central role in determining the physical properties and applications of many natural and engineered materials. By bridging the lattice geometry and rigid-folding kinematics, this study…
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
Packing and covering linear programs (PC-LPs) form an important class of linear programs (LPs) across computer science, operations research, and optimization. In 1993, Luby and Nisan constructed an iterative algorithm for approximately…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…
Bistability and snap-through instabilities are central to various mechanisms in nature and engineering, enabling rapid movement and large shape changes with minimal energy input. These phenomena are easily demonstrated by bending a piece of…
We develop a folding approach to study two-dimensional symmetry-enriched topological (SET) phases with the mirror reflection symmetry. Our folding approach significantly transforms the mirror SETs, such that their properties can be…
We examine the solution of the constraints in spherically symmetric general relativity when spacetime has a flat spatial hypersurface. We demonstrate explicitly that given one flat slice, a foliation by flat slices can be consistently…
Leaves and flowers frequently have a characteristic rippling pattern at their edges. Recent experiments found similar patterns in torn plastic. These patterns can be reproduced by imposing metrics upon thin sheets. The goal of this paper is…
We investigate the dynamics of a single semiflexible filament, under the action of a compressing force, using numerical simulations and scaling arguments. The force is applied along the end to end vector at one extremity of the filament,…
It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pair of leaves. Moreover, it is possible for a (small) strict…
Origami morphing, obtained with patches of piecewise smooth isometries separated by straight fold lines, is an exquisite art that has already received considerable attention in the mathematics and mechanics literature. Curved fold lines,…
For $m=2$ and $m=3$ we prove that any connected, oriented, open manifold $M^m$ admits a simple branched covering map over $\mathbb{R}^m$. When $M$ has $k$ ends and $k$ is finite, the degree of the cover can be taken to be $mk$. Regardless…
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…
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
Purpose: The class of models that can be represented by STL files is larger than the class of models that can be printed using additive manufacturing technologies. Stated differently, there exist well-formed STL files that cannot be…
We present a single, connected tile which can tile the plane but only non-periodically. The tile is hexagonal with edge markings, which impose simple rules as to how adjacent tiles are allowed to meet across edges. The first of these rules…