Related papers: Maximal origami flip graphs of flat-foldable verti…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
This paper shows a cut along a crease on an origami sheet makes simple modeling of popular traditional basic folds such as a squash fold in computational origami. The cut operation can be applied to other classical folds and significantly…
In this work, we propose a novel single-end morphing capacitive sensing method for shape tracking, FxC, by combining Folding origami structures and Capacitive sensing to detect the morphing structural motions using state-of-the-art sensing…
Origami is the art of folding paper into various patterns without cutting or tearing the paper. By viewing the paper as the complex plane, we iteratively compute and record all intersection points to construct mathematical origami sets.…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
An ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal…
Origami has shown the potential to approximate three-dimensional curved surfaces by folding through designed crease patterns on flat materials. The Miura-ori tessellation is a widely used pattern in engineering and tiles the plane when…
We present a universal crease pattern--known in geometry as the tetrakis tiling and in origami as box pleating--that can fold into any object made up of unit cubes joined face-to-face (polycubes). More precisely, there is one universal…
It has been known since 1996 that deciding whether a collection of creases on a piece of paper can be fully folded flat without causing self-intersection or adding new creases is an NP-Hard problem (Bern and Hayes). In their proof, a binary…
Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…
Origami, the traditional paper-folding art, has inspired the modern design of numerous flexible structures in science and engineering. In particular, origami structures with different physical properties have been studied and utilized for…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
We consider the problem of morphing between contact representations of a plane graph. In an $\mathcal F$-contact representation of a plane graph $G$, vertices are realized by internally disjoint elements from a family $\mathcal F$ of…
Origami structures have been proposed as a means of creating three-dimensional structures from the micro- to the macroscale, and as a means of fabricating mechanical metamaterials. The design of such structures requires a deep understanding…
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…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…
We consider first order gradient methods for effectively optimizing a composite objective in the form of a sum of smooth and, potentially, non-smooth functions. We present accelerated and adaptive gradient methods, called FLAG and FLARE,…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…