Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.00511 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909240355979264 |
|---|---|
| author | Gray, Kathryn Bell, Brian Sieper, Diana Kobourov, Stephen Schreiber, Falk Klein, Karsten Hong, Seokhee |
| author_facet | Gray, Kathryn Bell, Brian Sieper, Diana Kobourov, Stephen Schreiber, Falk Klein, Karsten Hong, Seokhee |
| contents | This paper aims to develop a mathematical foundation to model knitting with graphs. We provide a precise definition for knit objects with a knot theoretic component and propose a simple undirected graph, a simple directed graph, and a directed multigraph model for any arbitrary knit object. Using these models, we propose natural categories related to the complexity of knitting structures. We use these categories to explore the hardness of determining whether a knit object of each class exists for a given graph. We show that while this problem is NP-hard in general, under specific cases, there are linear and polynomial time algorithms which take advantage of unique properties of common knitting techniques. This work aims to bridge the gap between textile arts and graph theory, offering a useful and rigorous framework for analyzing knitting objects using their corresponding graphs and for generating knitting objects from graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_00511 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Wooly Graphs : A Mathematical Framework For Knitting Gray, Kathryn Bell, Brian Sieper, Diana Kobourov, Stephen Schreiber, Falk Klein, Karsten Hong, Seokhee Data Structures and Algorithms This paper aims to develop a mathematical foundation to model knitting with graphs. We provide a precise definition for knit objects with a knot theoretic component and propose a simple undirected graph, a simple directed graph, and a directed multigraph model for any arbitrary knit object. Using these models, we propose natural categories related to the complexity of knitting structures. We use these categories to explore the hardness of determining whether a knit object of each class exists for a given graph. We show that while this problem is NP-hard in general, under specific cases, there are linear and polynomial time algorithms which take advantage of unique properties of common knitting techniques. This work aims to bridge the gap between textile arts and graph theory, offering a useful and rigorous framework for analyzing knitting objects using their corresponding graphs and for generating knitting objects from graphs. |
| title | Wooly Graphs : A Mathematical Framework For Knitting |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.00511 |