Log In  

Cart #yijebofuse-0 | 2019-10-29 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA

I felt like ray marching a signed distance field in PICO-8.
(Don't ask me why..).

P#69443 2019-10-29 10:12

almost real-time 🤣

question: what is that cryptic mysqrt?
A faster approximation?

P#69450 2019-10-29 12:27

Beautiful ! Imagine this realtime. Your first star for you.

P#69456 2019-10-29 16:07

It's definitely slower than the built in sqrt().
But the built in version seems a bit inaccurate. E.g. sqrt(3.999) is greater than sqrt(4.001).

Which caused some odd surface normals on the sphere:

P#69462 2019-10-29 18:31

Now that is very interesting. It seems that the built in square root becomes less accurate with non-integer values. Not only is sqrt(3.999)<sqrt(4.0001), but it seems that sqrt(3.9) is equal to sqrt(4.08407). However, sqrt tends to work fine with large numbers so this gave me an idea.

  return shr(sqrt(shl(v,2)),1)

This is essentially sqrt(v*4)/2, but using bit shifting. Its not measurably faster than us multiplication but I think its useful to know what is being done here. Here it is implemented into the posted cart.

Cart #shox_square_root-0 | 2019-10-29 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA

Now this does have some limitations. It cuts off the top two bits of the input, limiting the size of inputs it can handle. Although the top bit is for sign, which may be outside of the domain for a sqrt function and could be handled separately if it isn't(it may involve switch to a logical shift, I haven't put thought into which is appropriate here). That only leaves one bit of magnitude being lost which will only be a problem for rather large numbers. Also since this only shifts the input by two bits, numbers may be small enough that they are still to small too be accurately handled.

You could also use multiplication and division directly as shifting can only multiply/divide by powers of two, but that will be slower and possibly less accurate. Picking the amount to shift/multiply will depend on the size of the inputs you expect.

P#69466 2019-10-29 19:45

And this indeed a known bug :/

P#69470 2019-10-29 20:06

Cart #ywosahuru-1 | 2019-10-30 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA

I had a play with some colours, patterns and reflections.

It still uses my slow square root. @Shoxidizer's trick unfortunately wasn't accurate enough to make the reflections come out okay - although it did make a big improvement in the original cart.

P#69482 2019-10-30 08:57 ( Edited 2019-10-30 09:15)

checkerboard reflection never gets old!

you should put a btn loop at the end - having the cursor destroying the image is deceiving!

P#69484 2019-10-30 11:34 ( Edited 2019-10-30 11:38)

Can you avoid the slow sqrt by comparing squared values only?
Eg x^2+y^2>r^2

P#69497 2019-10-30 23:00

Actually that's not a bad idea.
It could compare the squared distances of each object to get the nearest one, then square root. Would mean 1 sqrt per SDF sample instead of 4.

P#69499 2019-10-31 00:25

Hmm.. Couldn't quite get it working comparing the squared distances.

The issue is that it's a signed distance field, so sometimes the distances are negative (for points sampled inside solids).
I was able to kindof fudge it by calculating the squared distance times the sign of the value (e.g. if the distance is -5, it would use -25). I think it was working, but it was a bit of a mess and didn't feel much faster after all the workarounds, so I've rolled it back.

Anyway, here's a version that randomises the colours and positions, so you don't always get the same image.

Cart #ywosahuru-2 | 2019-10-31 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA

P#69515 2019-10-31 04:14

[Please log in to post a comment]

Follow Lexaloffle:          
Generated 2023-12-02 14:40:12 | 0.025s | Q:35