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 folding complexity of a length-n uniform string (all mountains or all valleys), and hence of a length-n pleat (alternating mountain/valley), is polylogarithmic in n. We also show that the maximum possible folding complexity of any string of length n is, meeting a previously known lower bound. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S., Langerman, S., & Uehara, R. (2009). Algorithmic folding complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 452–461). https://doi.org/10.1007/978-3-642-10631-6_47
Mendeley helps you to discover research relevant for your work.