A Greedy Algorithm for Generative String Art
Proceedings of Bridges 2022: Mathematics, Art, Music, Architecture, Culture, page 63--70 - aug 2022
Computational String Art is a method of creating a non-photorealistic rendering using lines drawn between pairs of pins. Given a set of pins and an image to render, we propose a greedy algorithm to determine a good set of lines to imitate the input. Implementation details are discussed, as well as some possible optimization to speed up the algorithm. We also propose some improvements to the basic greedy approach, provide a stopping condition and allow for the use of non-opaque strings. We illustrate our work with various results.
Images and movies
BibTex references
@InProceedings{DLD22, author = "Demoussel, Baptiste and Larboulette, Caroline and Dattatreya, Ravi", title = "A Greedy Algorithm for Generative String Art", booktitle = "Proceedings of Bridges 2022: Mathematics, Art, Music, Architecture, Culture", pages = "63--70", month = "aug", year = "2022", editor = "David Reimann, Douglas Norton and Eve Torrence", publisher = "Tessellations Publishing", address = "Phoenix, Arizona", url = "http://zabador.free.fr/Publications/2022/DLD22" }