|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of DoublePrecisionFractalGenerator in infpp.fractal |
---|
Subclasses of DoublePrecisionFractalGenerator in infpp.fractal | |
---|---|
class |
SimpleDoublePrecisionJuliaGenerator
The SimpleDoublePrecisionJuliaGenerator provides an implementation for calculating the number of required iterations to determine the divergence of the sequence of points obtained by the recursion zn + 1 = (zn)2 + c where c is the point passed to the setDefiningPoint method and is constant during the calculation of the fractal and z1 is a point determined by screen coordinates. |
class |
SimpleDoublePrecisionMandelbrotGenerator
The SimpleDoublePrecisionMandelbrotGenerator provides an implementation for calculating the number of required iterations to determine the divergence of the sequence of points obtained by the recursion z1 := 1, zn + 1 = (zn)2 + c where c is a point determined by screen coordinates. |
class |
ThreadedDoublePrecisionFractalGenerator
The Threaded DoublePrecisionFractalGenerator class provides an abstract class that serves as a common base for FractalGenerators using double precision floating point arithmetic and multiple threads to speed up the calculation. |
class |
ThreadedDoublePrecisionJuliaGenerator
The ThreadedDoublePrecisionJuliaGenerator provides an implementation for calculating the number of required iterations to determine the divergence of the sequence of points obtained by the recursion zn + 1 = (zn)2 + c where c is the point passed to the setDefiningPoint method and is constant during the calculation of the fractal and z1 is a point determined by screen coordinates. |
class |
ThreadedDoublePrecisionMandelbrotGenerator
The ThreadedDoublePrecisionMandelbrotGenerator provides an implementation for calculating the number of required iterations to determine the divergence of the sequence of points obtained by the recursion z1 := 1, zn + 1 = (zn)2 + c where c is a point determined by screen coordinates. |
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |