You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the final fractal executable for the naive chaos kernel will perform an IFS step with a random fid, but it might be better to iterate through all functions instead and output from each function.
The advantage is that we do not "steal" points from the original shape.
The disadvantage is that it does not deal with conditional probability. As a quick fix, maybe create an alpha value that is related to the probability?
The text was updated successfully, but these errors were encountered:
Note: This is distinct from a fully non-random IFS kernel (as discussed in #26). This issue is about doing a chaos game for step 1 and then an iterative step 2.
I think a good approach here would be to add different execution types to the Hutchinson(...) operator, so run!(...) will have an option to execute on :random, :semi-random, or non-random (for the method added in #26)
Currently, the final fractal executable for the naive chaos kernel will perform an IFS step with a random fid, but it might be better to iterate through all functions instead and output from each function.
The advantage is that we do not "steal" points from the original shape.
The disadvantage is that it does not deal with conditional probability. As a quick fix, maybe create an alpha value that is related to the probability?
The text was updated successfully, but these errors were encountered: