< b a c k

Here, I was interested in a simple idea : Find the largest square I can fit in the image. Find the next largest, and so on. I enjoyed certain qualities of the faceMap project - specifically how the image is broken apart but still readable. That space, where the image comes apart but reassembles, is a really interestesting area. In this case, I took the image and threshold to make a binary array (I will try this with colors soon, and perhaps some more advanced thresholding routines). I then searched for the largest square I could make. If there were several squares of the same size, I picked one at random to avoid all large squares crowding on one side. After choosing a square, I marked those pixels as off limits and moved on.