The algorithm behind this is similar to my other image, Eye of the Hypnotoad. The main difference is that this one is bounded by the Minkowski distance --- with p = 0.5 --- from the center instead of euclidean. When I say bounded that means that the breadth first traversal can't traverse past a given distance that increases with each iteration. There is also some proprietary tree pruning methods at play.