Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!julius.cs.uiuc.edu!psuvax1!psuvm!wtw101
From: WTW101@psuvm.psu.edu (Bill Warner)
Newsgroups: comp.sys.amiga.graphics
Subject: Re: Fast Mandelbrot Mapper
Message-ID: <91029.231158WTW101@psuvm.psu.edu>
Date: 30 Jan 91 04:11:58 GMT
References: <43065@nigel.ee.udel.edu>
Organization: Penn State University
Lines: 18

In article <43065@nigel.ee.udel.edu>, fhwri%CONNCOLL.BITNET@yalevm.ycc.yale.edu
says:
>
>Nico Francois' MandelBlitz will generate the complete Mandelbrot set in
>35 seconds on a 68000 Amiga in 32-color low-res. How much faster do you
>want a program to get? He uses an algorithm that is, to my knowledge,
>completely unique as well; all areas with the same color are bounded
>(the plot goes around the area). It's quite different to watch...
>                                                --Rick Wrigley
>                                                fhwri@conncoll.bitnet


Have you ever seen MandFXP 3.0 by Bruce Dawson and Steve LaRocque?  That is the
fastest mandelbrot program I have seen.  It does a 320x200x5 picture at 30
iterations in about 12 seconds on a stock Amiga.


                                                Chris