Face flips in origami tessellations

10/13/2019
by   Hugo A. Akitaya, et al.
0

Given a flat-foldable origami crease pattern G=(V,E) (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment μ:E→{-1,1} indicating which creases in E bend convexly (mountain) or concavely (valley), we may flip a face F of G to create a new MV assignment μ_F which equals μ except for all creases e bordering F, where we have μ_F(e)=-μ(e). In this paper we explore the configuration space of face flips for a variety of crease patterns G that are tilings of the plane, proving examples where μ_F results in a MV assignment that is either never, sometimes, or always flat-foldable for various choices of F. We also consider the problem of finding, given two foldable MV assignments μ_1 and μ_2 of a given crease pattern G, a minimal sequence of face flips to turn μ_1 into μ_2. We find polynomial-time algorithms for this in the cases where G is either a square grid or the Miura-ori, and show that this problem is NP-hard in the case where G is the triangle lattice.

READ FULL TEXT

page 4

page 6

page 7

page 8

page 11

page 12

research
03/27/2022

Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

Flat origami studies straight line, planar graphs C=(V,E) drawn on a reg...
research
08/30/2017

Planar Drawings of Fixed-Mobile Bigraphs

A fixed-mobile bigraph G is a bipartite graph such that the vertices of ...
research
01/23/2023

Splitting Plane Graphs to Outerplanarity

Vertex splitting replaces a vertex by two copies and partitions its inci...
research
07/20/2016

Dappled tiling

We consider a certain tiling problem of a planar region in which there a...
research
09/13/2023

Flat origami is Turing Complete

Flat origami refers to the folding of flat, zero-curvature paper such th...
research
08/31/2018

On the Area-Universality of Triangulations

We study straight-line drawings of planar graphs with prescribed face ar...
research
06/12/2016

A constrained clustering based approach for matching a collection of feature sets

In this paper, we consider the problem of finding the feature correspond...

Please sign up or login with your details

Forgot password? Click here to reset