Computationally Intensive Puns with Figurative Subgraphs

Year: 2018 Authors: Robert Bosch

Core claim

Figurative subgraphs can be optimized to render images, with spanning trees generally matching targets better than Eulerian subgraphs and Hamiltonian cycles.

Topics

figurative graph drawing, image approximation, Hamiltonian cycles, Eulerian subgraphs, spanning trees

Domains

graph theory, combinatorial optimization, Hamiltonian cycle, Eulerian graph, spanning tree, data art, visual punning, generative art

Methods

integer programming, local search, trace model, subtour elimination, sum-of-squares minimization

Media

grayscale target images, king-knight chessboard graph, emoji portraits, Königsberg map

Source status

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