Rigid Foldability is NP-Hard

12/04/2018
by   Hugo Akitaya, et al.
0

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 from 1-in-3 SAT. Unlike flat foldability of origami or flexibility of other kinematic linkages, whose complexity originates in the complexity of the layer ordering and possible self-intersection of the material, rigid foldability from a planar state is hard even though there is no potential self-intersection. In fact, the complexity comes from the combinatorial behavior of the different possible rigid folding configurations at each vertex. The results underpin the fact that it is harder to fold from an unfolded sheet of paper than to unfold a folded state back to a plane, frequently encountered problem when realizing folding-based systems such as self-folding matter and reconfigurable robots.

READ FULL TEXT
research
10/14/2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

We prove that deciding whether the Runner can win this turn (mate-in-1) ...
research
04/20/2021

Finding Geometric Representations of Apex Graphs is NP-Hard

Planar graphs can be represented as intersection graphs of different typ...
research
06/21/2001

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

We show that computing the lexicographically first four-coloring for pla...
research
02/08/2021

On Computation Complexity of True Proof Number Search

We point out that the computation of true proof and disproof numbers for...
research
04/29/2021

On the Complexity of Recognizing Integrality and Total Dual Integrality of the {0,1/2}-Closure

The {0,1/2}-closure of a rational polyhedron { x Ax ≤ b } is obtained b...
research
06/09/2020

Folding Simulation of Rigid Origami with Lagrange Multiplier Method

Origami crease patterns are folding paths that transform flat sheets int...
research
08/27/2018

Fair redistricting is hard

Gerrymandering is a long-standing issue within the U.S. political system...

Please sign up or login with your details

Forgot password? Click here to reset