stx@vax1.mankato.msus.edu (01/12/91)
My girlfriend has playing around with a program called "fracint" for the Ibm.
It is fractal generator that is really nice. I was wondering if there was an
equivelent for the amiga? What is considered the best fractal program for the
amiga? I have seen ads in Amiga World for a program called ?????? reprents
different mathmatical formulas in fractal form but 120 bucks is a little steep.
What is the best PD/Shareware Frac program?
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stx@vax1.mankato.msus.edu Kevin Whyte Proud Owner of an
Computer Services Box 45
Mankato State University Amiga 1000
stx@att1.mankato.msus.edu Mankato MN 56001
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~dac@prolix.ccadfa.oz.au (Andrew Clayton) (01/12/91)
In article <1991Jan11.233512.1@vax1.mankato.msus.edu>, stx@vax1.mankato.msus.edu writes: > My girlfriend has playing around with a program called "fracint" for the Ibm. > It is fractal generator that is really nice. I was wondering if there was an > equivelent for the amiga? What is considered the best fractal program for the > amiga? I have seen ads in Amiga World for a program called ?????? reprents > different mathmatical formulas in fractal form but 120 bucks is a little steep. > What is the best PD/Shareware Frac program? I've seen Fractint (V.14) and it's a neat piece of 'stone soup' code, with lots and lots of different Mandelbrot types, and support for many of IBM's weird and wonderful resolutions. However, I haven't seen a version for the Amiga. There are other programs though. 'MandFXP' by CygnusSoft (now released into the Public Domain, I believe) is a capable Mandelbrot and Julia set program. Has some neat optimisations, and can save/load piccies (including coordinates, so you can abort a calculation, save it, and then later on reload the picture, and restart calculations). Another program you might seek is 'MandelBlitz' by Nico Francois. This is also PD, and uses an 'edge detection' technique with colour fill, instead of 'find each pixel'. Nice and fast, especially on a 68030/68882 combination. There are sundry other Mandelbrot programs for the Amiga, but they're the two that *I* like best. > stx@vax1.mankato.msus.edu Kevin Whyte Proud Owner of an Dac -- _l _ _ // Andrew Clayton. Canberra, Australia. I Post . (_](_l(_ \X/ ccadfa.cc.adfa.oz.au!prolix!dac . . I am. -------- I cannot send or receive mail to or from sites outside of Australia.
napo@niksula.hut.fi (Hannu Napari) (01/13/91)
In article <18834185.ARN09718@prolix.ccadfa.oz.au> dac@prolix.ccadfa.oz.au (Andrew Clayton) writes: >Another program you might seek is 'MandelBlitz' by Nico Francois. This is also >PD, and uses an 'edge detection' technique with colour fill, instead of 'find >each pixel'. Nice and fast, especially on a 68030/68882 combination. MandelBlitz is good, but it lacks something very important... A custom iterations gadget. Maximum of 1024 iterations is far too little. I wonder why Nico didn't add such gadget into his otherwise magnificient program. -- Napo $ Hey Nath, hama para kripa kijiye. Door kara andhakar, gyan (leon) $ ka aloka dijiye, binsa dwesh lobha bamese chhin lijiye, $ manamey prem shanti bhar dijiye... $
dac@prolix.ccadfa.oz.au (Andrew Clayton) (01/13/91)
In article <NAPO.91Jan12233534@elektra.hut.fi>, Hannu Napari writes: > MandelBlitz is good, but it lacks something very important... A custom > iterations gadget. Maximum of 1024 iterations is far too little. > I wonder why Nico didn't add such gadget into his otherwise magnificient > program. Picky picky. :-). I find that 1024 is just too slow (and that's on a 30Mhz 68030/68882). Just how deep into the Mandelbrot set are you going anyway? Past a certain point, it's all self referential and derivative anyway! Anything at 256 iterations is cool enough for moi! > Napo $ Hey Nath, hama para kripa kijiye. Door kara andhakar, gyan > (leon) $ ka aloka dijiye, binsa dwesh lobha bamese chhin lijiye, > $ manamey prem shanti bhar dijiye... (Que?) Dac -- _l _ _ // Andrew Clayton. Canberra, Australia. I Post . (_](_l(_ \X/ ccadfa.cc.adfa.oz.au!prolix!dac . . I am. -------- I cannot send or receive mail to or from sites outside of Australia.
ccplumb@rose.uwaterloo.ca (Colin Plumb) (01/27/91)
> In article <NAPO.91Jan12233534@elektra.hut.fi>, Hannu Napari writes: > >> Maximum of 1024 iterations is far too little. ccadfa.cc.adfa.oz.au!prolix!Dac wrote: >Picky picky. :-). > >I find that 1024 is just too slow (and that's on a 30Mhz 68030/68882). > >Just how deep into the Mandelbrot set are you going anyway? Past a certain >point, it's all self referential and derivative anyway! Anything at 256 >iterations is cool enough for moi! Wimp. It is a fact of life that, however much processing speed you have, you're always going to start generating pictures that take over 20 minutes. Of course, the last Mandelbrot demo I wrote was for a 28-processor transputer system, so I had it in places where 15,000 iterations was too fuzzy; I had to go to 17,000. At 513x513 resolution, this wrapped the flops counter past 2^32. I had to switch to a floating point flops accumulator! (Actually, I counted z^2+c iterations and scaled the number of seconds to produce statistics. But 16,000 times a quarter of a million is 4 billion: wrap!) Really, there are some great spots I couldn't find with lower iteration levels around n=5,000. -- -Colin