On Thursday, November 3, 2016 at 10:14:38 AM UTC-7, Stewart Robert Hinsley wrote:
I've been looking at efficient generation of deep zoomed images of the attractors of IFS systems.
Steward Robert Hinsley,
Sounds pretty good: no on zooming IFS
I'm not familiar with any existing algorithms.
The Frame driven algorithm excludes regions:
several of the Julia IFS algorithms make some features more intense.
Siegel disks are sometimes made by more of a Chaos nesting algorithm.
But zooming has been used mostly in iterative Julia sets and Mandelbrots.
I have already an application for such a zoom:
if a Newton's algorithm Julia set is used to find complex roots,
then zooming in on the root is desirable.
Roger Bagula
I've created an algorithm which generates images at least as deep as
10^200 in a time less that twice that taken for unzoomed images (for the
same pixel count).
Does anyone know what the state of the art is for this? (On the one hand
the algorithm seemed fairly obvious once I started looking into the
topic; on the other hand what's obvious to me hasn't always been obvious
to others.)
--
SRH
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)