0
$\begingroup$

The equations/algorithms of that define attractors such as these:

http://www.chaoscope.org/doc/attractors.htm

With given parameters and number of iterations output a set of positions, the size of the set is the same as the number of iterations.


Can attractors like these, or their $2D$ versions be rearranged to simulate an infinite number of iterations?

The new equation/algorithm would take the parameters and additionally $X, Y$ and, if applicable, $Z$ coordinates, but no number of iterations.

Returning a non-negative real number instead of a set of positions, this number would represent the distance between the specified position and the nearest point in the attractor.

  • 0
    I don't have time to elaborate (and thus am just leaving my thoughts as comments), but due to finite precision among other things, we don't know what the true "infinite iterations" attractors actually look like, and thus those graphics are mere approximations of those attractors (and we're hoping that they're a good approximation). It's a bit hard to calculate "proximity" of something approximate if you don't know what the exact thing is like...2011-05-16

0 Answers 0