5 ms·
Computing the color of a pixel is computing the (averaged) integral of some iteration counting function. It looks like there are areas where this function is pr
by stabbles 3y ago
Computing the color of a pixel is computing the (averaged) integral of some iteration counting function. It looks like there are areas where this function is pretty chaotic -- isn't the problem very ill-conditioned? If so adding more precision may not even help?
- BlueTemplar 3y agoSeems like this algorithm does not do that ? https://github.com/ProfJski/FloatCompMandelbrot/blob/master/FloatCompMset.md#perhaps-obvious-but-also-no-supersampling https://github.com/ProfJski/FloatCompMandelbrot/blob/master/... > [...] Instead, we put pixels in a one-to-one relation to the points they represent. You can think of this as mapping some imaginary point on the pixel, such as its center or corner, onto the complex plane, and making the whole pixel represent that value.
- stabbles 3y agoI don't get the point of the project. So they show that rounding errors are amplified because a problem is ill-conditioned. Yeah, of course. The higher precision computation they do is probably equally wrong then. Averaging / smoothing can sometimes help to make a problem better conditioned, so I expected they'd do something like that to get an accurate solution regardless.