Generate the fractal Mandelbrot set (points are either in or out, not colorful escape time of the points that are outside) and encode it as a quadtree. Serialize the quadtree breadth first, generating an infinite string, essentially the set from most significant to least significant "bits" (though the naive way to encode quadtrees is base 3).
A neat unending computation project.
Are their any squares in the Mandelbrot set for which it is unusually difficult to determine what to do for the corresponding quadtree node?
No comments :
Post a Comment