Continue reading
Tag Archives: mandelbrot
How to Create a 1k Mandelbrot Demo in OpenGL / C++ with Source Code
PS3 Realtime Mandelbrot Fractal Explorer
(Demoscene) 38644: Mandelbulb in 1024 Bytes (OpenGL/GLSL)
Benoît Mandelbrot Died Last Thursday at 85
[Demoscene] Mandelkern: Direct3D Mandelbulb in 1k!
Do You Know the Mandelbox Fractal?
DX11 DirectCompute Buddhabrot Demo
ASCII Art: Mandelbrot Fractal
DX11 DirectCompute Demos: Waves and Fractals
Kümmel Mandelbrot Benchmark
The aim of this program is to explore the possibilities of modern 32bit CPU’s how to speed up (without any loss of precision or non-exact calculation) the traditional Mandelbrot algorithm including also full support for multiple cores. The Mandelbrot algorithm is implemented with double precision floating point numbers. You will find 3 different in the archive file:
- KMB_V0.53H-32b-MT_FPU…..: only standard FPU code is used for calculation
- KMB_V0.53H-32b-MT_SSE2….: SSE2 tuned version almost best for all CPU’s
- KMB_V0.53H-32b-MT_SSE2_PM.: SSE2 tuned version especially for Intel Pentium M and Intel Core1 CPUs (it’s in fact KMB_V0.53G-32b-MT_SSE2 as Version H was slower)
Download Kümmel Mandelbrot Benchmark HERE.
Here are my scores on an old clock-stock Core2Duo 6600: