Abstract
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm theory, can suggest a lot of powerful tools that can be used both in descriptive and prescriptive ways and that apparently have not yet been used for creative knitting. The obtained results are short (optimal size) recursive descriptions for complex patterns; creation of new complex recursive patterns; and the application of three-valued algebra operations to combine and create a wide variety of new patterns.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, P., Malcolm, T., Tennant, R., Fall, C.: Knitting for Dummies (2002)
Griswold, R.E.: Designing Weave Structures Using Boolean Operations, Part 1,2,3, http://www.cs.arizona.edu/patterns/weaving/webdocs.html
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, London (2001)
Knuth, D.E.: The Art of Computer Algorithms: Sorting and Searching, vol. 3. Addison-Wesley, London (1973)
Leighton, F.T.: Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA (1992)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (2005)
Suzuki, D., Miyazaki, T., Yamada, K., Nakamura, T., Itoh, H.: A Supporting System for Colored Knitting Design. In: Logananthara, R., Palm, G., Ali, M. (eds.) IEA/AIE 2000. LNCS (LNAI), vol. 1821, Springer, Heidelberg (2000)
The Home of Mathematical Knitting, http://www.toroidalsnark.net/mathknit.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bernasconi, A., Bodei, C., Pagli, L. (2007). Knitting for Fun: A Recursive Sweater. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72914-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72913-6
Online ISBN: 978-3-540-72914-3
eBook Packages: Computer ScienceComputer Science (R0)