Path: utzoo!attcan!uunet!lll-winken!csd4.milw.wisc.edu!mailrus!bbn!ulowell!m2c!wpi!lfoard
From: lfoard@wpi.wpi.edu (Lawrence C Foard)
Newsgroups: comp.graphics
Subject: Re: Fractals
Message-ID: <1133@wpi.wpi.edu>
Date: 1 Mar 89 17:54:26 GMT
References: <160.2404E090@muadib.FIDONET.ORG> <11150@s.ms.uky.edu> <1191@hudson.acc.virginia.edu>
Reply-To: lfoard@wpi.wpi.edu (Lawrence C Foard)
Organization: Worcester Polytechnic Institute, Worcester, MA. USA
Lines: 22

In article <1191@hudson.acc.virginia.edu> saj@lucifer.psyc.virginia.edu (Steve Jacquot) writes:
>In article <11150@s.ms.uky.edu> jgary@ms.uky.edu (James E. Gary) writes:
>>...
>>Sorry, no source for you, but there was a 'fast way to skip black' algorithm
>But what if one of the little spidery filaments that connects it to itself
>slips between two of the points you test?  Perhaps this isn't a problem
>in practice, but it worried me enough that I didn't want to implement
>this algorithm.
>....

When I saw the first SA Mandelbrot article a few years ago I made the program
to do it but noticed that most of the time was being spent in the black area.
To get around this I made a recursive routine that took a 16X16 square and
filled it. It then found areas where they where all the same color and marked
them and then split the square four ways and did it again. I have never had
problems with this missing filaments but it accasionally has problems on the
borders of very smooth areas. I was thinking of writting to SA with this but
never got enough time to write the letter.
-- 
/----------------------------------------------------------------------------\
| My opinions are violently objected to by my employer. I was fired last year|
| but they forgot to remove my account. Lawrence Foard (entropy)             |
\----------------------------------------------------------------------------/