Re: IFS inverse algoritm
From: Suncode (sol_developments_at_hotmail.com)
Date: 06/02/04
- Next message: Suncode: "Re: Works fine!"
- Previous message: Roger L. Bagula: "Re: Mauldin's appolonian works! - Now also in Q-basic"
- In reply to: Stewart Robert Hinsley: "Re: IFS inverse algoritm"
- Messages sorted by: [ date ] [ thread ]
Date: Wed, 2 Jun 2004 18:15:34 -0000
> 1) The random or chaos game algorithm isn't the only means of drawing an
> IFS. OTOH, I think your technique works equal well with the xerox or
> copy machine and deterministic algorithms.
I know, take a look at the titlepage of my fractal-site (in swedish, på
svenska) :
http://members.chello.se/solgrop/Fractalus/
The background image is also a IFS.
Maybe I will discribe the method later, have not got time for this rigth
now.
> 2) There are Iterated Function Systems in which there is not a unique
> index that gets you to a point, so your technique is not universally
> applicable, at least without modification.
I'we got some idéas :-) (the Frac-Man method is involved)
> However, you've produced an ("escape time") algorithm for IFSs that I
> haven't encountered before.
Looking for new algorithms to use for fractal production is kinda my time of
fun really :-)
SunCode.
- Next message: Suncode: "Re: Works fine!"
- Previous message: Roger L. Bagula: "Re: Mauldin's appolonian works! - Now also in Q-basic"
- In reply to: Stewart Robert Hinsley: "Re: IFS inverse algoritm"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|