Rigorous bounds for polynomial Julia sets (Q523958)

The usual methods for producing pictures of Julia sets are iterating a complex function on a mesh of initial points in the complex plane, which leave us wondering whether the point sampling was reliable, whether the grid was fine enough, whether the partial orbits were long enough, and whether rounding errors were relevant. To avoid point sampling, function iteration and rounding errors, the authors present an algorithm for computing images of polynomial Julia sets by using the core idea in celling mapping and label propagation. The algorithm can reliably classify entire rectangles in the complex plane as being on either side of the Julia set and computes a refinable quadtree decomposition of the complex plane adapted to the Julia set which can be used for rendering and for approximating geometric properties such as the area of the filled Julia set and the fractal dimension of the Julia set. Also, the algorithm works for different types of filled Julia sets: connected sets with non-empty interior, connected sets with empty interior, and totally disconnected Cantor sets.