A Greedy Algorithm for Generative String Art

Year: 2022 Authors: Baptiste Demoussel; Caroline Larboulette; Ravi Dattatreya

Core claim

A well-chosen greedy heuristic can generate effective string art faster, and it can be improved with stopping criteria, opacity control, and importance maps.

Topics

computational string art, greedy algorithm, non-photorealistic rendering, performance optimization

Domains

algorithm design, optimization, graph traversal, generative art, computer graphics, pen plotter art, non-photorealistic rendering

Methods

greedy selection, image subtraction, heuristic evaluation, cache-locality optimization

Media

pins, string, grayscale pixel grid, non-opaque grey strings

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.