Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!zephyr.ens.tek.com!tekcrl!scott
From: scott@tekcrl.LABS.TEK.COM (Scott Huddleston)
Newsgroups: comp.graphics
Subject: Re: Mandelbrot/Julia optimizations (was Re: Excluding Mandelbrot set)
Message-ID: <5227@tekcrl.LABS.TEK.COM>
Date: 13 Dec 89 02:02:31 GMT
References: <7106@ficc.uu.net> <3544@quanta.eng.ohio-state.edu> <234@xochitl.UUCP> <601@otto.bf.rmit.oz.au> <558@xdos.UUCP>
Reply-To: scott@tekcrl.LABS.TEK.COM (Scott Huddleston)
Organization: Tektronix, Inc., Beaverton,  OR.
Lines: 14

.In article <234@xochitl.UUCP>, cheeks@edsr.eds.com (Mark Costlow) writes:
.>In article <7106@ficc.uu.net>, peter@ficc.uu.net (Peter da Silva) writes:
.>> After you have determined that a point is in the set, you know
.>>that all the other points visited in determining that are in the set as well,
Not in the Mandelbrot set, because
.>  But, isn't the path different for each different C?
(yes).
The idea has merit for rendering Julia sets, though.  It also works for
points outside a Julia set, if you're rendering escape count.  Just
save your iteration history and when an iteration escapes, you know the
escape count for every point in the sequence.
-- 
Scott Huddleston
scott@crl.labs.tek.com