Interestingly, we can apply orbit traps to newton fractals.
Welcome back Ada ! (she looks quite unamused on the right picture)
@lhp22 Yes, so here it's a newton fractal,
I started with Wikipedia algorithm: https://en.wikipedia.org/wiki/Newton_fractal
It works fine but you need to provide the derivative function as input
Then I found this, which varies slightly the input of the function and make the difference (basically it's a very simple numerical differentiator). For regular functions it works well:
@lhp22 For the "orbit trap" technique, it's a bit more experimental given there is very few good resources on it.
The idea is that for any complex function you iterate, you create a trajectory for every starting point. The behavior of this trajectory is then used to color the pixel corresponding to the starting point
With bitmap traps, the behavior is: when the trajectory goes into a square of a given size centered to zero, we color the starting point using the pixel in the bitmap that corresponds to the point in the square (not sure I'm 100% clear)
Basically, you have points in your trajectory. If one point is into the square, then you color according to the bitmap mapped on this square (here I'm using Ada)
Mastodon.ART — Your friendly creative home on the Fediverse! Interact with friends and discover new ones, all on a platform that is community-owned and ad-free. Admin: @Curator. Moderators: @EmergencyBattle, @ScribbleAddict, @TapiocaPearl, @Otherbuttons, @katwylder