# Fractals/fractint

Fractint is a freeware computer program that can render and display many kinds of fractals. Source code is available

# Authors

The primary authors of Fractint 19.5 are:
* Bert Tyler
* Timothy Wegner
* Jonathan Osuch
* Wesley Loewer

# code

* GAME-TOYS-Fractint

# Images

commons:Category:Fractals created with Fractint

# Fractint parameters
## Image Calculation Parameters

"Example: corners=-0.739/-0.736/0.288/0.291 Begin with these coordinates as the range of x and y coordinates, rather than the default values of (for type=mandel) -2.0/2.0/-1.5/1.5. When you specify four values (the usual case), this defines a rectangle: x- coordinates are mapped to the screen, left to right, from xmin to xmax, y-coordinates are mapped to the screen, bottom to top, from ymin to ymax. Six parameters can be used to describe any rotated or stretched parallelogram: (xmin,ymax) are the coordinates used for the top-left corner of the screen, (xmax,ymin) for the bottom-right corner, and (x3rd,y3rd) for the bottom-left. Entering just "CORNERS=" tells Fractint to use this form (the default mode) rather than CENTER-MAG (see below) when saving parameters with the [B] command."
"This is an alternative way to enter corners as a center point and a magnification that is popular with some fractal programs and publications. Entering just "CENTER-MAG=" tells Fractint to use this form rather than CORNERS (see above) when saving parameters with the [B] command. The [TAB] status display shows the "corners" in both forms. When you specify three values (the usual case), this defines a rectangle: (Xctr, Yctr) specifies the coordinates of the center of the image while Mag indicates the amount of magnification to use. Six parameters can be used to describe any rotated or stretched parallelogram: Xmagfactor tells how many times bigger the x- magnification is than the y-magnification, Rotation indicates how many degrees the image has been turned, and Skew tells how many degrees the image is leaning over. Positive angles will rotate and skew the image counter-clockwise."
Mag indicates the amount of magnification to use. Initial value ( no zoom ) is 6.66666667e-01. "If the magnification is set to 1, the range on the Y axis is +1 to -1 - this is zoomed in too much and cuts off some of the top & bottom bulbs on the Mandelbrot set. With magnification set to .666666667, the range on the Y axis is +1.5 to -1.5, which gives a view of the complete Mandelbrot set. " (Ryan Davenport )

# fractint files

Most important files are :
* par files - plane description and build-in type
* frm files - fractal type ( formula). Here one cendefine iterated function ( map)
* map files - color gradient. In Fractint map denotes color gradient not function ( math formula)
* IFS Files - *.ifs

## gif

* Fractint does save the parameters in its GIF file
* one can use command line to extract par file from the gif file

## formula

Notes:
* If a-b>1 AND b=1, then the sets will look similar to the a-b=1 case, but will be surrounded by infinite numbers of satellite islands of varing size,
* for b=1, use sqrt(3)= .5773503... for a=3, and cuberoot(4)=.6299605...

## map

Conversions
* converting
* the KAM map
One can use/check Fractint map files in Gnuplot:
Fractint_default_colour_map (256 colors) serving for 4 different needs in a single colour table
* 0..15: The first 16 colours are encoded exactly as with all 16 colour modes (0Dh/0Eh/10h/12h) which in turn use the same 4 bit encoding as the colour attributes of all text modes (*1). It is backward compatible with the EGA and CGA adapters.
* 16..31: The next 16 deliver an even lit 4 bit black (10h) to white (1Fh) grayscale ( binary coded gray scale)
* 32..247: 216 (3x8x3x3) colours: an evenly spaced, HSV colour cylinder (*2) based on a
** 24 hue RGB wheel, starting at blue, with 8 subdivisions per R,G and B, resulting in 24 (3x8) discrete "hues". Each of those is present in
** 3 level of saturation (colourfulness)
** 3 level of intensity(value of brightness)
* 248..255: 8 color (= 256 - (16 + 16 + 216)) definitions are guaranteed free for user applications ( user definable colours), usually black. 8 unused definitions. By guaranteeing that the BIOS will not touch them.
VGA color index for 256 colors (= 16x16). It shows index not directly rgb color value.
VGA color idex values:
* decimal: from 0 to 255
* hexadecimal: from #00 to #FF ( or $00 in old notation)
* Fractint_default_colour_map
* VGA palette
* VGA palette organised
See also:
* M Sargent: MAPView : This is a stand-alone program that displays the color spectrum of any selected MAP file.
* M Sargent: MAP file collection - Fractint 256-color MAP files ( color palettes). They are text files containing RGB triplets, which are easy to create or edit. This ZIP archive contains a small collection. There are hundreds if not thousands of these files available on the Web. The programs allow you to select MAP files from their GUI menus, and usually show a preview of their color spectra.
* Fractal-Zoomer color maps ( the same structure as for Fractint)

## par

"Fractint uses Parameter files to save/restore all options and settings, required to recreate particular images. The parameters required to describe an image require very little disk space, especially compared with saving the image itself. "
Parameter files
* They are ordinary text files
* can contain parameter for one file or named groups of parameters, looking something like this:
These sections are called parset sections and describe a fractal equation, a view area, parameters and a color palette.
For standard view of parameter plane and Mandelbrot set :
or :
Parameter file for FractInt ( extension PAR) :
Julia set :
To use it :
* Save file to fractint main directory.
* Run fractint.
* press 2 key
* press F6 key
* select par file ( default is usr/share/xfractint/pars/fractint.par )
One can :
* save command to par file with b key
* change from corners to center with F7 key
* select par file with F6 key
* load par file with ctrl-@
Reset causes Fractint to reset all calculation related parameters to their default values. Non-calculation parameters such as "printer=", "sound=", and "savename=" are not affected. The reset=1730 in the parameter file shows that it was created with 17.3 version of Fractint.
Search the code :
result :

### decomposition

Aproximation of field lines on the parameter plane ( exterioar of Mandelbrot set) by 256-decomposition
See also:
* Field_lines_binary_Trinary_decomposition

### Lists

* zoom
* par files at spanky
* nehee par collection
* fracton lists
* Hoppy's list

# code
## Drawing Method

Description from Fractint Version 20.04
The "passes option" (<X> options screen or "passes=" parameter) selects one of
* the single-pass
* dual-pass
* triple-pass
* solid-guessing (default)
* solid-guessing after pass n
* boundary tracing
* tesseral,
* synchronous orbits
* orbits modes
This option applies to most fractal types.
Single-pass mode ("1") draws the screen pixel by pixel. Dual-pass ("2") generates a half-resolution screen first as a preview using 2x2-pixel boxes, and then generates the rest of the dots with a second pass. Dual-pass uses no more time than single-pass. Triple-pass ("3") generates the coarse first pass of the solidguessing mode (see "g" below), then switches to either "1" (with low resolution video modes) or "2" (with higher resolution video modes). The advantage of '3' vs '2' is that when using high resolution modes, the first pass has a much lower resolution (about 160x120) and is therefore much quicker than the first pass of the passes=2 mode. However, with the '2' mode, the first pass does not represent wasted time. The '3' mode wastes the effort of generating the coarse first screen.
The single, dual, and triple pass modes all result in identical images. These modes are for those who desire the highest possible accuracy. Most people will want to use the guessing mode, described next.
Solid-guessing ("g") is the default. It performs from two to four visible passes - more in higher resolution video modes. Its first visible pass is actually two passes - one pixel per 4x4, 8x8, or 16x16 pixel box is generated, and the guessing logic is applied to fill in the blocks at the next level (2x2, 4x4, or 8x8). Subsequent passes fill in the display at the next finer resolution, skipping blocks which are surrounded by the same color. Solid-guessing can guess wrong, but it sure guesses quickly!
Solid-guessing stop after pass n ("g1" through "g6") are a variation on the guessing mode in which the algorithm stops after the nth pass. This facility is for exploring in low resolution when you'd rather see a low resolution image with large blocky pixels filling the whole screen than a small low resolution image such as you get with the <v> (View Windows) command. Note that on the <x> screen you can't directly type g1 or g2. Press g repeatedly until you get the option you want, or else use the left or right cursor keys.
Boundary Tracing ("b"), which only works accurately with fractal types (such as the Mandelbrot set, but not the Newton type) that do not contain "islands" of colors, finds a color boundary, traces it around the screen, and then "blits" in the color over the enclosed area.
Tesseral ("t") is a sort of "super-solid-guessing" option that successively divides the image into subsections and colors in rectangles that have a boundary of a solid color. It's actually slower than the solid-guessing algorithm, but it looks neat, so we left it in. This mode is also subject to errors when islands of color appear inside the rectangles.
Diffusion Scan ("d") is a drawing type based on dithering techniques. It scans the image spreading the points evenly and to each point it paints a square of the appropriate size so that the image will be incrementally enhanced. This method calculates ALL the points in the image being a good substitute for Single/Dual/Triple pass and presents a quick visualization even in the slowest fractals. With "fillcolor=0" (below) the squares are not painted and the points are spread over the image until all have being calculated (sort of a "Fade In").
The "fillcolor=" option in the <X> screen or on the command line sets a fixed color to be used by the Boundary Tracing and Tesseral calculations for filling in defined regions. The effect of this is to show off the boundaries of the areas delimited by these two methods.
Orbits ("o") draws an image by plotting the orbits of the escape time fractals. This technique uses the same coordinates to draw an image as the other passes options, sets "passes=1" and no symmetry, and then plots the orbits for each pixel. Zooming into a "passes=o" image is in fact zooming into the "passes=1" image, and the resulting image may not be what is expected. To find interesting places to investigate, press <O> after an image has completed and watch the behaviour of the orbits as the cursor is moved around the screen. See Orbits Window (p. 36).
The "outside=summ" option causes Orbits to increment a pixel's color number every time an orbit touchs it; the resulting display is a 2-d histogram. If "outside=" is some other value, then the "inside=" color determines the color of the plotted orbits. If "inside=0", then the color number is incremented at the start of each pixel of the passes=1 image.
The "orbitdelay=" option controls how many orbits are computed before the orbits are displayed on the screen. This allows the orbits to settle down.
The "orbitinterval=" option causes Orbits to plot every nth orbit point.
A non-zero value of the "periodicity=" option causes Orbits to not plot orbits that have reached the bailout conditions or where an orbit goes off the visible area of the image. A zero value of periodicity will plot all orbits except as modified by orbitdelay and orbitinterval.
Synchronous orbits ("s") is an experimental mode using the "fractal witchcraft" algorithm based on the Almondbread implementation by Michael Ganss. This algorithm optimizes deep zooms by calculating parallel orbits starting at different points, and subdividing when the orbits break formation. Michael's implementation had to be extensively modified to work with Fractint's DOS medium memory model environment.
Synchronous orbits (also known as SOI) has some limitations. SOI is loosely coupled with fractint and most options don't work with it. Only types mandel and julia are implemented. SOI is only useful for very deep zooms, but only up to the limit of double precision. Within this narrow magnification range, SOI can result in tremndous speedups. If you invoke fractint with "debug=3444" on the command line, a long double (rather than double) version will be used, which allows zooming about 1000 times deeper. SOI really needs to be ported to fractint's arbitrary precision. This will likely happen only after Fractint is moved to a better programming environment.

## algorithms
### Escher like tilings of Julia sets

* c = -1.24
* Fat Douady rabbit
* Basilia Julia set
In Version 19.6 new features include: new fractal types {=HT_ESCHER escher_julia} and {=HT_VL volterra-lotka} courtesy Michael Sargent.
Escher-Like Julia Sets
These unique variations on the Julia set theme, presented in The Science of Fractal Images, challenge us to expand our pre-conceived notions of how fractals should be iterated. We start with a very basic Julia formula:
The standard algorithm would test each iterated point to see if it "escapes to infinity". If its size or "modulus" (its distance from the origin) exceeds a preselected Bailout Test (p. 100) value, it is outside the Julia set, and it is banished to the world of multicolored level sets which color-cycle spectacularly. But another way of describing an escaped point is to say that it is "attracted" to infinity. We make this decision by calculating whether the point falls within the "target set" of all points closer to infinity than the boundary created by the bailout value. In this way, the "disk around infinity" is conceptually no different from the disks around Finite Attractors (p. 188) such as those used for Newton fractals.
In the above formula, with c = (0, 0i), this standard algorithm yields a rather unexciting circle. But along comes Peitgen to tell us that "since T [the target set] can essentially be anything, this method has tremendous artistic potential. For example, T could be a so-called p- norm disk ... or a scaled filled-in Julia set or something designed by hand. This method opens a simple [beware when he uses words like that] and systematic approach to Escher-like tilings."
So, what we do is iterate the above formula, scale each iteration, and plug it into a second Julia formula. This formula has a value of c selected by the user. If the point converges to this non-circular target set:
we color it in proportion to the overall iteration count. If not, it will be attracted to infinity and can be colored with the usual outside coloring options. This formula uses a new Fractint programming feature which allows the use of a customized coloring option for the points which converge to the target Julia set, yet allows the other points to be handled by the standard fractal engine with all of its options.
With the proper palette and parameters for c, and using the Inversion (p. 94) option and a solid outside color from the Color Parameters p. 130), you can create a solar eclipse, with the corona composed of Julia-shaped flames radiating from the sun's surface.
If you question the relevance of these images to Escher, check out his Circle Limit series (especially III and IV). In his own words: "It is to be doubted whether there exist today many ... artists of any kind, to whom the desire has come to penetrate to the depths of infinity.... There is only one possible way of ... obtaining an "infinity" entirely enclosed within a logical boundary line.... The largest ... shapes are now found in the center and the limit of infinite number and infinite smallness is reached at the circumference.... Not one single component ever reaches the edge. For beyond that there is "absolute nothingness." And yet this round world cannot exist without the emptiness around it, not simply because "within" presupposes "without", but also because it is out there in the "nothingness" that the center points of the arcs that go to build up the framework are fixed with such geometric exactitude."
References:
* Ernst, B. The Magic Mirror of M. C. Escher, Barnes & Noble, 1994, pp. 102-11.
* Peitgen, H.-O. and Saupe, D. The Science of Fractal Images, Springer-Verlag, 1988; pp. 185, 187.
One can search the source code using:
Results:

### boundary trace
# Install

* ubuntu : xfractint
* windows-7 with dosbox
* iterated dynamics is an open source fractal generator based on the DOS fractint program. Doc

# How does Fractint achieve its speed?

Answer from the sci.fractals FAQ, by Michael C. Taylor and Jean-Pierre Louvet with numerous contributions by others.
Fractint's speed (such as it is) is due to a combination of:
* Reducing computation by Periodicity checking and guessing solid areas (especially the "lake" area).
* Using hand-coded assembler in many places.
* Using fixed point math rather than floating point where possible (huge improvement for non-coprocessor machine, small for 486's, moot for Pentium processors).
* Exploiting symmetry of the fractal.
* Detecting nearly repeating orbits, avoid useless iteration (e.g. repeatedly iterating 02+0 etc. etc.).
* Obtaining both sin and cos from one 387 math coprocessor instruction.
* Using good direct memory graphics writing in 256-color modes.
The first three are probably the most important. Some of these introduce errors, usually quite acceptable.

# Help

* wikipedia
* fractalforums : fractint board
* Fractint.txt

# References

* fractint by Claude
* ↑ fractint Image Calculation Parameters
* ↑ Fractaal forum : FractInt > Mag
* ↑ Converting between FractInt and Fractal eXtreme palettes
* ↑ the KAM map by Fred Schimmel
* ↑ retrocomputing SE question: why-were-those-colors-chosen-to-be-the-default-palette-for-256-color-vga ?
* ↑ fountainware : vga color palettes
* ↑ A short Introducion to PAR Files by Laurent Chabin
* ↑ julian haight : filmer instructions
* ↑ Fractint doc index
* ↑ Fractint par files by Rupert Russell
* ↑ Video for FRACTINT by Chabin Laurent
* ↑ Fractint .par file page
* ↑ fractint Image Calculation Parameters
* ↑ [Fractint] FOTD 27-07-11 (Bad Moon on the Rise [No Rating])
* ↑ Rendering the Field Lines of the Mandelbrot Set by Richard A Thomson
* ↑ Fractint deep zoom
* ↑ Index of /spanky/pub/fractals/params
* ↑ nehee par collection
* ↑ fracton links
* ↑ Fractint .par file page by Hopy
* ↑ faqs.org : sci/fractals-faq