The algorithm consists of two steps: creating a
histogram and then rendering the histogram.
Creating the histogram First, one iterates a set of functions, starting from a randomly chosen point
P = (P.x,P.y,P.c), where the third coordinate indicates the current color of the point. :Set of flame functions: \begin{cases} F_1(x,y), \quad p_1 \\ F_2(x,y), \quad p_2 \\ \dots \\ F_n(x,y), \quad p_n \end{cases} In each iteration, choose one of the functions above where the probability that
Fj is chosen is
pj. Then one computes the next iteration of
P by applying
Fj on
(P.x,P.y). Each individual function has the following form: :F_j(x,y) = \sum_{V_k \in Variations} w_k \cdot V_k(a_j x + b_j y +c_j,d_j x + e_j y +f_j) where the parameter
wk is called the weight of the
variation Vk. Draves suggests that all w_k:s are non-negative and sum to one, but implementations such as Apophysis do not impose that restriction. The functions
Vk are a set of predefined functions. A few examples are • V0(
x,
y) = (
x,
y) (Linear) • V1(
x,
y) = (sin
x,sin
y) (Sinusoidal) • V2(
x,
y) = (
x,
y)/(
x2+
y2) (Spherical) The color
P.c of the point is blended with the color associated with the latest applied function
Fj: : P.c := (P.c + (Fj)color) / 2 After each iteration, one updates the histogram at the point corresponding to
(P.x,P.y). This is done as follows: histogram[x][y][FREQUENCY] := histogram[x][y][FREQUENCY]+1 histogram[x][y][COLOR] := (histogram[x][y][COLOR] + P.c)/2 The colors in the image will therefore reflect what functions were used to get to that part of the image.
Rendering an image To increase the quality of the image, one can use
supersampling to decrease the noise. This involves creating a histogram larger than the image so each pixel has multiple data points to pull from. For example, create a histogram with 300×300 cells in order to draw a 100×100 px image; each pixel would use a 3×3 group of histogram buckets to calculate its value. For each pixel
(x,y) in the final image, do the following computations: frequency_avg[x][y] := average_of_histogram_cells_frequency(x,y); color_avg[x][y] := average_of_histogram_cells_color(x,y); alpha[x][y] := log(frequency_avg[x][y]) / log(frequency_max); //frequency_max is the maximal number of iterations that hit a cell in the histogram. final_pixel_color[x][y] := color_avg[x][y] * alpha[x][y]^(1/gamma); //gamma is a value greater than 1. The algorithm above uses
gamma correction to make the colors appear brighter. This is implemented in for example the Apophysis software. To increase the quality even more, one can use gamma correction on each individual color channel, but this is a very heavy computation, since the
log function is slow. A simplified algorithm would be to let the brightness be linearly dependent on the frequency: final_pixel_color[x][y] := color_avg[x][y] * frequency_avg[x][y]/frequency_max; but this would make some parts of the fractal lose detail, which is undesirable. ==Density estimation==