Related papers: Folding a Paper Strip to Minimize Thickness
In this paper we report a new promising idea on the design and manufacturing of ply composite structures, tailored to exhibit maximum stiffness under given weight constraints and loading conditions. It is based on the idea behind an…
Efficient optimization of topology and raster angle has shown unprecedented enhancements in the mechanical properties of 3D printed materials. Topology optimization helps reduce the waste of raw material in the fabrication of 3D printed…
In our common experience, crumpling a sheet requires external compressive force and leads to a random network of folds. However, thin sheets have been theoretically predicted to spontaneously transition from a flat to a crumpled state…
We investigate the mechanical response of thin sheets perforated with a square array of mutually orthogonal cuts, which leaves a network of squares connected by small ligaments. Our combined analytical, experimental and numerical results…
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…
Existing Civil Engineering structures have limited capability to adapt their configurations for new functions, non-stationary environments, or future reuse. Although origami principles provide capabilities of dense packaging and…
We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…
Consider a curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding $P$ in the Euclidean space $\boldsymbol R^3$. The singular set $C$ of $P$ as a space curve is…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
It is well known that an elastic sheet loaded in tension will wrinkle and that the length scale of the wrinkles tends to zero with vanishing thickness of the sheet [Cerda and Mahadevan, Phys. Rev. Lett. 90, 074302 (2003)]. We give the first…
In 3D printing, stiff fibers (e.g., carbon fiber) can reinforce thermoplastic polymers with limited stiffness. However, existing commercial digital manufacturing software only provides a few simple fiber layout algorithms, which solely use…
Neural networks can implement arbitrary functions. But, mechanistically, what are the tools at their disposal to construct the target? For classification tasks, the network must transform the data classes into a linearly separable…
Traditional origami starts from flat surfaces, leading to crease patterns consisting of Euclidean vertices. However, Euclidean vertices are limited in their folding motions, are degenerate, and suffer from misfolding. Here we show how…
It is well known that the set of origami constructible numbers is larger than the classical straight-edge and compass constructible numbers. However, the Huzita-Justin-Hatori origami constructible numbers remain algebraic so that the…
The steady state packing fraction of a tapped granular bed is studied for different grain shapes via a discrete element method. Grains are monosized regular polygons, from triangles to icosagons. Comparisons with disk packings show that the…
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…
We use a regular arrangement of kirigami elements to demonstrate an inverse design paradigm for folding a flat surface into complex target configurations. We first present a scheme using arrays of disclination defect pairs on the dual to…
Structures like galaxies and filaments of galaxies in the Universe come about from the origami-like folding of an initially flat three-dimensional manifold in 6D phase space. The ORIGAMI method identifies these structures in a cosmological…
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…
In the graph balancing problem the goal is to orient a weighted undirected graph to minimize the maximum weighted in-degree. This special case of makespan minimization is NP-hard to approximate to a factor better than 3/2 even when there…