Algorithmic folding complexity
How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pattern of equidistant creases (viewed as a binary string)? Define the folding complexity of a mountain-valley string as the minimum number of simple folds required to construct it. We show that the fol...
| Huvudupphovsmän: | , , , , , |
|---|---|
| Övriga upphovsmän: | |
| Materialtyp: | Artikel |
| Språk: | en_US |
| Publicerad: |
Springer
2011
|
| Länkar: | http://hdl.handle.net/1721.1/62218 https://orcid.org/0000-0003-3803-5703 |