Autor:	Damian, Mirela, Demaine, Erik, Dulieu, Muriel, Flatland, Robin, Hoffman, Hella, Hull, Thomas C., Lynch, Jayson, Ramaswami, Suneeta
Rok vydání:	2017
Předmět:	Computer Science - Discrete Mathematics Mathematics - Combinatorics 05B99 F.2.2
Druh dokumentu:	Working Paper
Popis:	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. Comment: 21 pages with a 6-page appendix
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1703.06373 Zobrazit plný text záznamu View this record from Arxiv