Related papers: When is an origami set a ring?
In this paper we explore and develop a simple set of rules that apply to cutting, pasting, and folding honeycomb lattices. We consider origami-like structures that are extinsically flat away from zero-dimensional sources of Gaussian…
Origami-based design holds promise for developing materials whose mechanical properties are tuned by crease patterns introduced to thin sheets. Although there has been heuristic developments in constructing patterns with desirable…
In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction…
Origami structures have been widely explored in robotics due to their many potential advantages. Origami robots can be very compact, as well as cheap and efficient to produce. In particular, they can be constructed in a flat format using…
We give a hierarchial set of axioms for mathematical origami. The hierachy gives the fields of Pythagorean numbers, first discussed by Hilbert, the field of Euclidean constructible numbers which are obtained by the usual constructions of…
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…
We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset $F$ of creases is…
This paper establishes a rigorous geometrical framework for spherical origami, origami using spherical sheets based on spherical geometry. Two settings are treated: origami restricted to the unit sphere ($\mathbb{S}^2$), and…
In this article, the projectivity of finitely generated flat modules of a commutative ring are studied from a topological point of view. Then various interesting results are obtained. For instance, it is shown that if a ring has either a…
We provide a generalization of the construction of a spectrum of a commutative ring as a locally ringed space, applicable to cone injectivity classes in general contexts, especially in locally finitely presentable categories. In its full…
A foundational result in origami mathematics is Kawasaki and Justin's simple, efficient characterization of flat foldability for unassigned single-vertex crease patterns (where each crease can fold mountain or valley) on flat material. This…
Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…
We show that minimally 3-rigid block-and-hole graphs, with one block or one hole, are characterised as those which are constructible from $K_3$ by vertex splitting, and also, as those having associated looped face graphs which are…
Fold maps are higher dimensional versions of Morse functions, which play important roles in the studies of smooth manifolds, and such general maps also have been fundamental tools in the studies of smooth manifolds by using generic maps. In…
The aim of this article is to give practicing teachers an overview about the theory behind paperfolding, it is my qualifying thesis(Zulassungsarbeit) as a teacher in Germany. It is a survey about the relations between paperfolding and…
The field of rigid origami concerns the folding of stiff, inelastic plates of material along crease lines that act like hinges and form a straight-line planar graph, called the crease pattern of the origami. Crease pattern vertices in the…
Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…
We explore the surprisingly rich energy landscape of origami-like folding planar structures. We show that the configuration space of rigid-paneled degree-4 vertices, the simplest building blocks of such systems, consists of at least two…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…