of mandelbrot set

- sequential
- Escape time algorithms ( with different bailout tests):

- boolean escape time funtion = Mandelbrot algorithm ( draws M-st and its exterior = 2 colors)

if PointIsInMset(c,iterationMax,EscapeRadius)

then Form1.Canvas.Pixels[iX,iY]:=clBlack // M-set

else Form1.Canvas.Pixels[iX,iY]:=clWhite; // exterior of M-set - discrete (integer) Escape-Time Algorithm = level set method (
**LSM/M**); draws M-set and color bands in its exterior - continuous escape time algorithm and Renormalizing the Mandelbrot Escape by Linas
- eLLM/M =Level lines method for escape time for Mandelbrot set; draws lemniscates of M-set, = contour lines method
- decomposition of exterior of M-set

- boolean escape time funtion = Mandelbrot algorithm ( draws M-st and its exterior = 2 colors)
**CPM/M**= Hubbard-Douady potential of Mandelbrot set- DRM
**DEM/M**=Distance Estimation Method for Mandelbrot set = Milnor algorithm

- calculates what is essentially the boundary of the Mandelbrot set using contour integration by Robert Davies; see cx.zip
- Interior and exterior distance bounds for the Mandelbrot by Albert Lobo Cusidó
- ASCI graphic scripts by ???
- spider algorithm
- Jungreis algorithm
- abstract M-set
- theorethical M-set
- MandelSwarm by JJ Ventrella

- Escape time algorithms ( with different bailout tests):
- parallel
- Mandelbrot set computed by 6 Transputers
- Drakopoulos V., N. Mimikou & T. Theoharis, “An Overview of Parallel Visualization Methods for Mandelbrot and Julia Sets”, Computers & Graphics, 27, 2003, pp. 635-646.

- speed improvements
- cardioid checking :
- mirror symetry along (around) the real, horizontal ( X ) axis

- Tricks
- using Hypot(zx,zy) function instead of (sqr(zx)+sqr(zy)); For me it is slower
- use Z1=C for initial conditions instead of Z0 = 0 ( one iterations for every point less). It can not be done in (binary ) decomposition and potential ( CPM)

Hyperion Mandelbrot Fractal Demo with GPGPU techniques Jérôme 'JeGX' Guinot

- Computing over the Reals: Foundations for Scientific Computing Mark Braverman and Stephen Cook
- "Can We See the Mandelbrot Set?", The College Mathematics Journal, v. 26, no. 2, March 1995.
- IS THE MANDELBROT SET COMPUTABLE? PETER HERTLING
- Hypercomputing the Mandelbrot Set? by Potgieter PH

M. Casco Associates

On Fractal Coloring Techniques by Jussi Härkönen Colouring fractals and The colours of fractals by J.P. Louvet

hidden dimension

Newton's method, Julia and Mandelbrot sets, and complex coloring by Martin Pergler

The Mandelbrot set iteration by François Labelle

COLORING DYNAMICAL SYSTEMS IN THE COMPLEX PLANE Francisco Garcia ...

Decorating the Mandelbrot Exterior by ...

Colouring Algorithm at JW's page

orbit traps from Fractal Domains

Orbit detection by J C Sprott

algorithms by in~igo quilez

Fracture screensaver -algorithms

Fractals and multi layer coloring algorithms Mandelbtor Dazibao

Javier Barrallo and Santiago Sanchez

Fractal Drawing Styles 6.0 by Jesse Jones

standard coloring algorithms for Ultra Fractal 3.

rendering Mandelbrot set fractal through a pixel shader in DirectX9. by Humus

Texturing Techniques by eNZed Blue

"eNZedBlue"

news:1134985830.505612.69810@g14g2000cwa.googlegroups.com...

>> Hello list,

>>

>> I've posted a gallery on my site with a few images showing the

>> Mandelbrot set rendered with a bitmap texture applied. For escapees, I

>> take the last value of z before it escapes the boundary circle, then

>> convert it to polar coordinates and use the angle/distance from the

>> complex origin as a texture u/v pair. For points inside the set no

>> texture is applied. Also, I have rendered the set as a tree, to show

>> the doubling of the number of repeats of the texture mapping each

>> iteration.

>>

>> http://www.enzedblue.com/Fractals/Fractals.html

>>

>> There are some videos too. Hope you like them! :-)

>>

>> Cheers,

>> Chris Hayton

Autor: Adam Majewski

adammaj1-at-o2-dot--pl

Feel free to e-mail me. (:-))

About