## step 0: image source

## step 1: blurred image to smooth color noise

## step 2: difference of differently blurred images (edges)

## final step: delaunay triangulation of edge points filled with smoothed color

## Links

- how the sausage is made (source for this page)
- the proverbial butterfly flapping it's wings (Lizz's project that exposed me to this branch of Mathematics. Thanks Lizz!)
- math is hard (wikipedia: k-means clustering)
- math is science (wikipedia: voronoi diagram)
- math is art (a manually created version of what I automated. Thanks Tim!)
- CS theory is hard (wikipedia: Delaunay triangulation)
- CS engineering is easy (Delaunay triangulation library)
- more CS theory (wikipedia: Ramer Douglas Peucker algorithm. Thanks Darius!)
- more CS engineering (polygon simplification library)