Buddhatbrot Computation

Math Chaos

Multithreaded Buddhatbrot Computation

Rendering fractals with the Buddhabrot technique discovered by Melinda Green.

Algorithm Overview

An optimization is implemented to compute “hint” points, i.e. points that are likely to produce viable samples.

Only points that escape between the minimum and maximum recursion depth are relevant in later stages.

Thus these points are saved as “hints” and are used for later computation.

Optimization Details

One hint file may be computed for multiple iterations of the image computation. It can be read from a file or computed when needed. The hint does not have to have the same exact parameters of the image, especially resolution. It just needs to provide quality candidate points for the threads to use in the recursion. Additionally, a histogram method is used to compute the final brightness of each pixel in the exported image. The darkest 1/256th of the pixels are assigned color (0,0,0), the next 1/256th get color (1,1,1), and so on until the brightest color, (255, 255, 255) is reached. Tested with clang++ on arch.

Note

Note

One hint file may be computed for multiple iterations of the image computation. It can be read from a file or computed when needed. The hint does not have to have the same exact parameters of the image, especially resolution. It just needs to provide quality candidate points for the threads to use in the recursion. Additionally, a histogram method is used to compute the final brightness of each pixel in the exported image. The darkest 1/256th of the pixels are assigned color (0,0,0), the next 1/256th get color (1,1,1), and so on until the brightest color, (255, 255, 255) is reached. Tested with clang++ on arch.

Buddhabrot Album