Connected Spanning Trees
We reconstruct greyscale images as connected spanning trees on a grid using king's and knight's moves. The idea is simple: connect each vertex to its darkest neighbor. It works very well.
Two-Colored Convex Tiles
We tile photographs with two-colored convex quadrilaterals whose corners touch their neighbors. A slider lets each tile grow or shrink based on local brightness. Simple geometry, recognizable images.
Morphing Polygons
We let each vertex in a checkerboard move freely to match the underlying image brightness. The result reproduces photos surprisingly well, and the best part is you can play chess on them!
Walking Lines
We start at the darkest pixel of a downsampled image and walk to the next darkest, drawing a line colored by the darker of the two. Repeat until reaching the brightest pixel. The outcome is compelling, though it struggles with busy or complex images.
