Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!hp4nl!star.cs.vu.nl!msschaa
From: msschaa@cs.vu.nl (Schaap MS)
Newsgroups: comp.graphics
Subject: Re: More Mandelbrot Stuff
Message-ID: <4637@draak.cs.vu.nl>
Date: 27 Nov 89 17:05:49 GMT
References: <AFOIANI.89Nov25202207@dante.nmsu.EDU>
Reply-To: msschaa@cs.vu.nl (Schaap MS)
Distribution: comp
Organization: VU Informatica, Amsterdam
Lines: 21

In article <AFOIANI.89Nov25202207@dante.nmsu.EDU> afoiani@nmsu.EDU (Anthony Foiani) writes:
>
>I saw the program FRACTINT mentioned a few articles back.  This is an
>excellent program for the IBM PC-types.  The Mandelbrot implementation
>it uses is the familiar iterate-until-magnitude-greater-than-2
>algorithm, but it is implemented in 16- and 32-bit fixed-point(?)
>and/or integer math.  thus, when running it on a 286 or 386, it can do
>a full 360x480x1024iter Mandelbrot in about 30 seconds.  [well, that's
>on a 386SX @16.7MHz]

The binaries and the source of FractInt v. 10.0 are available
on Simtel in PD:<MSDOS.GRAPHICS> as

    FRAINT10.ARC       (the binaries)

and
    FRASRC10.ARC       (I believe, the source)


Michael Schaap
MSSCHAA@CS.VU.NL


Brought to you by Super Global Mega Corp .com