Minimal forcing sets for 1D origami
From MaRDI portal
Publication:6284495
arXiv1703.06373MaRDI QIDQ6284495FDOQ6284495
Authors: Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami 
Publication date: 18 March 2017
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.
This page was built for publication: Minimal forcing sets for 1D origami
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284495)
