A Greedy Algorithm for Generative String Art - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

A Greedy Algorithm for Generative String Art

Résumé

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.
Fichier principal
Vignette du fichier
bridges2022-63.pdf (11.96 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03901755 , version 1 (15-12-2022)

Identifiants

  • HAL Id : hal-03901755 , version 1

Citer

Baptiste Demoussel, Caroline Larboulette, Ravi Dattatreya. A Greedy Algorithm for Generative String Art. Bridges 2022 ( Mathematics・Art ・Music・Architecture・Culture ), Aug 2022, Aalto, Finland. ⟨hal-03901755⟩
183 Consultations
620 Téléchargements

Partager

Gmail Facebook X LinkedIn More