Given a grayscale target image I and a graph G = (V,E), whose vertices we have placed in fixed positions in the plane, we find subgraphs of G — Hamiltonian cycles, spanning Eulerian subgraphs, and spanning trees — that closely resemble image I.