# Minimal forcing sets for 1D origami

## TL;DR

This paper introduces a linear time algorithm for finding the smallest forcing sets in 1D origami, ensuring a flat fold by determining the minimal subset of creases that dictate the entire folding pattern.

## Contribution

It presents the first efficient linear time algorithm to compute minimum forcing sets in one-dimensional origami.

## Key findings

- Linear time algorithm for minimum forcing sets
- Optimal forcing sets guarantee flat foldings
- Applicable to 1D origami models

## Abstract

This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.