Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!emory!gatech!udel!mmdf
From: dave@cs.arizona.edu (Dave P. Schaumann)
Newsgroups: comp.sys.amiga.graphics
Subject: Re: Fast Mandelbrot Mapper
Message-ID: <43090@nigel.ee.udel.edu>
Date: 29 Jan 91 17:58:10 GMT
Sender: mmdf@ee.udel.edu
Lines: 10

The algorithm given in the book determines the minimum distance to the
edge of the interior of the set, and then fills in a circle based on
that calculation.  Naturally, points already colored can be skipped.

This leads to a great speed-up since many points can be skipped.  This would
be very good for exploring regions which require a high iteration value
(ie >>1000).

Dave Schaumann		|  And then -- what then?  Then, future...
dave@cs.arizona.edu	|  		-Weather Report