Derivative of the Amazing fractal, or how to render it ?

[David Makin]

It just struck me that a more GPU friendly manner to accomplish the same thing as the binary search is to:

1. Step until DE<closeness or "inside" - set "count" to zero, set teststep to laststepdistance/n
2. Step backwards by teststep and increment "count" and get DE for new position
3. if DE<closeness or "inside" and count<n goto 2
4. point found

Use larger values of n for more accuracy, I would guess around 10 would be fine in most cases.
Technically you shouldn't need the "count" at all but....