Related papers: Origami edge-paths in the curve graph
In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative…
Contact path geometries are curved geometric structures on a contact manifold comprising smooth families of paths modeled on the family of all isotropic lines in the projectivization of a symplectic vector space. Locally such a structure is…
Origami and Kirigami, the famous Japanese art forms of paper folding and cutting, have inspired the design of novel materials & structures utilizing their geometry. In this article, we explore the geometry of the lesser known popup art,…
We characterize the phase-space of all Helical Miura Origami. These structures are obtained by taking a partially folded Miura parallelogram as the unit cell, applying a generic helical or rod group to the cell, and characterizing all the…
In this short note, we construct a minimally intersecting pair of simple closed curves that fill a genus 2 surface with an odd, greater than 3, number of punctures. This finishes the determination of minimally intersecting filling pairs for…
A \emph{simple} $s,t$ path $P$ in a rectangular grid graph $\mathbb{G}$ is a Hamiltonian path from the top-left corner $s$ to the bottom-right corner $t$ such that each \emph{internal} subpath of $P$ with both endpoints $a$ and $b$ on the…
The use of origami in engineering has significantly expanded in recent years, spanning deployable structures across scales, folding robotics, and mechanical metamaterials. However, finding foldable paths can be a formidable task as the…
We discuss well known geometric constructions via paper-folding. The note is written primary for school students.
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
Inspired by the allure of additive fabrication, we pose the problem of origami design from a new perspective: how can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve…
The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…
The first part of this paper is a survey on Teichmueller curves and Veech groups, with emphasis on the special case of origamis where much stronger tools for the investigation are available than in the general case. In the second part we…
This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…
Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through…
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…
Kirigami involves cutting a flat, thin sheet that allows it to morph from a closed, compact configuration into an open deployed structure via coordinated rotations of the internal tiles. By recognizing and generalizing the geometric…
An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$, denoted by $\ip(G)$, is the minimum number of isometric paths needed to cover all vertices of $G$. In this paper, we…
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…