Flattening single-vertex origami: the non-expansive case

TL;DR

This paper addresses the problem of flattening single-vertex origami configurations with non-expansive motions, providing a finite-step algorithm for cases where the total length is between π and 2π, expanding previous solutions.

Contribution

It introduces a motion planning algorithm for flattening single-vertex origami with total length in [π, 2π), solving a previously open case with non-expansive motions.

Findings

The algorithm works in a finite number of steps.

Precise bounds depend on the number of links and angle deficit.

Extends previous solutions to a new length range.

Abstract

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, to a flat, non-overlapping position, in such a way that the paper is not torn, stretched and, for rigid origami, not bent anywhere except along the given creases. Streinu and Whiteley showed how to reduce the problem to the carpenter's rule problem for spherical polygons. Using spherical expansive motions, they solved the cases of open < \pi and closed <= 2\pi spherical polygons. Here, we solve the case of open polygons with total length between [\pi, 2\pi), which requires non-expansive motions. Our motion planning algorithm works in a finite number of discrete steps, for which we give precise bounds depending on both the number of links and the angle deficit.