#recursive mandelbrot
34 messages ยท Page 1 of 1 (latest)
super cool ๐
I'm a huge fan of mandelbrot renders that provide unique visuals for the interior of the set
yeah, i didnt manage to come up with much when i was gpu rendering, but cpu rendering allows for this sort of thing
Regarding optimization, multithreading will help a lot (it's embarrassingly parallel) and GPU rendering would help a lot too. You can also look into http://www.mrob.com/pub/muency/marianisilveralgorithm.html which speeds things up a ton.
also, its resolution agnostic, so it looks the same (albeit noisier) at lower res
picture there is 16k and took ~11 mins
on my i5-10400f
i think ive seen that before, it seems hard to implement though lol
it's not too bad, it's just recursive ๐
oh sort of divide and conquer style?
there are some tricky aspects, easy off by one errors
that makes it a lot easier if thats the case
and still pretty paralelisable
yep, still very parallelizable
im just wondering how itd be implemented alongside the inside recursion
because you have to worry about things outside the squares, not just inside
you would probably only use this for the exterior
everything in the inside you'd need to do individually
yeah that makes more sense
though the outside only takes seconds
i should probably send the code
meh i need to polish it first
eg output jxl rather than ppm (just raw pixels)
it's understandable that the outside is much faster
you can see the difference in size, even with lossless compression
the vast majority is <5 iterations, the inside is 1k+
indeed, I was doing some mandelbrot rendering a while back and also outputting to ppms and it was a lot ๐