Related papers: Minimal forcing sets for 1D origami
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
Kirigami, the art of paper cutting, has become a paradigm for mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns that derive inspiration from geometric art forms…
Origami inspired architectures offer a powerful route toward lightweight, reconfigurable, and programmable robotic systems. Yet, a unified mechanics framework capable of seamlessly bridging rigid folding, elastic deformation, and stability…
Kirigami-inspired designs can enable self-folding three-dimensional materials from flat, two-dimensional sheets. Hierarchical designs of connected levels increase the diversity of possible target structures, yet they can lead to longer…
An oracle $A$ is low-for-speed if it is unable to speed up the computation of a set which is already computable: if a decidable language can be decided in time $t(n)$ using $A$ as an oracle, then it can be decided without an oracle in time…
Making kirigami-inspired cuts into a sheet has been shown to be an effective way of designing stretchable materials with metamorphic properties where the 2D shape can transform into complex 3D shapes. However, finding the optimal solutions…
Thin elastic sheets bend easily and, if they are patterned with cuts, can deform in sophisticated ways. Here we show that carefully tuning the location and arrangement of cuts within thin sheets enables the design of mechanical actuators…
We present an approach to overcoming challenges in dynamical dexterity for robots through tunable origami structures. Our work leverages a one-parameter family of flat sheet crease patterns that folds into origami bellows, whose axial…
Shortest paths play an important role in mathematical modeling and image processing. Usually, shortest path problems are formulated on planar graphs that consist of vertices and weighted arcs. In this context, one is interested in finding a…
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…
Let $S_{g}$ denote the closed orientable surface of genus $g$. In joint work with Huang, the first author constructed exponentially-many (in $g$) mapping class group orbits of pairs of simple closed curves whose complement is a single…
This paper describes an efficient approach to constructing a resultant polyline with a minimum number of segments and arcs. While fitting an arc can be done with complexity O(1) (see [1] and [2]), the main complexity is in checking that the…
We develop a geometric approach to understand the mechanics of perforated thin elastic sheets, using the method of strain-dependent image elastic charges. This technique recognizes the buckling response of a hole under external load as a…
In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the Token Sliding model. In this problem, a graph is provided along…
We solve the problem of one-dimensional peg solitaire. In particular, we show that the set of configurations that can be reduced to a single peg forms a regular language, and that a linear-time algorithm exists for reducing any…
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…
A hitting set for a collection of sets is a set that has a non-empty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum cardinality. Motivated by instances of the hitting set problem…
In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a…
The development of laser scanning techniques has popularized the representation of 3D shapes by triangular meshes with a large number of vertices. Compression techniques dedicated to such meshes have emerged, which exploit the idea that the…
An origami extrusion is a folding of a 3D object in the middle of a flat piece of paper, using 3D gadgets which create faces with solid angles. In this paper we focus on 3D gadgets which create a top face parallel to the ambient paper and…