Related papers: Origami edge-paths in the curve graph
If $E$ is a minimal elliptic curve defined over $\ZZ$, we obtain a bound $C$, depending only on the global Tamagawa number of $E$, such that for any point $P\in E(\QQ)$, $nP$ is integral for at most one value of $n>C$. As a corollary, we…
Kirigami, art of paper cutting, enables two-dimensional sheets transforming into unique shapes which are also hard to reshape once with prescribed cutting patterns. Rare kirigami designs manipulate cuts on three-dimensional objects to…
Origami crease patterns are folding paths that transform flat sheets into spatial objects. Origami patterns with a single degree of freedom (DOF) have creases that fold simultaneously. More often, several substeps are required to…
An EPG-representation of a graph $G$ is a collection of paths in a plane square grid, each corresponding to a single vertex of $G$, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
We develop a theory of random flat-foldable origami. Given a crease pattern, we consider a uniformly random assignment of mountain and valley creases, conditioned on the assignment being flat-foldable at each vertex. A natural method to…
A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the…
We provide a simple linear time transformation from a directed or undirected graph with labeled edges to an unlabeled digraph, such that paths in the input graph in which no two consecutive edges have the same label correspond to paths in…
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
Origami metamaterial design enables drastic qualitative changes in the response properties of a thin sheet via the addition of a repeating pattern of folds based around a rigid folding motion. Known also as a mechanism, this folding motion…
We consider unbounded curves without endpoints. Isomorphism is equivalence up to translation. Self-avoiding plane-filling curves cannot be periodic, but they can satisfy the local isomorphism property: We obtain a set $\Omega $ of coverings…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
We prove that for every surface $\Sigma$ of Euler genus $g$, every edge-maximal embedding of a graph in $\Sigma$ is at most $O(g)$ edges short of a triangulation of $\Sigma$. This provides the first answer to an open problem of Kainen…
Let $S_g$ denote a closed, orientable surface of genus $g \geq 2$ and $\mathcal{C}(S_g)$ be the associated curve complex. The mapping class group of $S_g$, $Mod(S_g)$ acts on $\mathcal{C}(S_g)$ by isometries. Since Dehn twists about certain…
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…
To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…
It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs…
Let $P : \Sigma \rightarrow S$ be a finite degree covering map between surfaces. Rafi and Schleimer show that there is an induced quasi-isometric embedding $\Pi : \mathcal{C}(S) \rightarrow \mathcal{C}(\Sigma)$ between the associated curve…
We prove that for every integer $t\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\chi$-bounded. This is essentially the strongest…
Recently there have been extensive theoretical, numerical and experimental works on curved-fold origami. However, we notice that a unified and complete geometric framework for describing the geometry and mechanics of curved-fold origami,…