KD Tree

Pixels are recursively filtered into random axis-aligned binary partitions based on brightness (30*R + 59*G + 11*B). Partitions are rotated at each level. There's a bug causing each split to create 3 instead 2 visually distinct regions, but at the end of the day, isn't it just about making a cool-looking picture?