Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ukma!jgary
From: jgary@ms.uky.edu (James E. Gary)
Newsgroups: comp.sys.amiga
Subject: Re: MandFXP?
Summary: Does Vroom use recursive algorithm?
Message-ID: <11608@s.ms.uky.edu>
Date: 28 Apr 89 17:22:37 GMT
References: <10845@polyslo.CalPoly.EDU> <8818@polya.Stanford.EDU>
Reply-To: jgary@ms.uky.edu (James E. Gary)
Organization: U of Kentucky, Mathematical Sciences
Lines: 14

In article <8818@polya.Stanford.EDU> rokicki@polya.Stanford.EDU (Tomas G. Rokicki) writes:
>Nothing is as nice as MandelVroom.  Nothing.  An earlier version is on
<stuff deleted>

Does MandelVroom use the recursive perimeter algorithm that RMand (a     
relatively recent PD prog) uses? RMand is quite quick, but doesn't have
all the bells and whistles that I would like to see. Briefly, rmand
calculate the colors for the pixels forming the perimeter (the entire
perimeter) of the screen and if the same, does a flood fill. This tends
to flood the 'black' areas (those actually in the set) quickly, where
most other algorithms spend most of their time. Anyone working on a 
full featured Mandelbrot program should consider this algorithm. I haven't
implemented it, but understand it pretty well and will be happy to 
correspond via e-mail with interested parties.