🚀The code for Lipschitz Pruning is now online thanks to @wbrbr.bsky.social🚀

🔗 github.com/wbrbr/Lipsch...

It's a simple Vulkan app useful for experiments. Also, the monument done by @elie-michel.bsky.social is released under a CC-BY license📄

(poke @mattkeeter.com I remember you asked!)

Different types of bound can be used - and it is even relatively simple to extract not only one, but multiple convex bounds around the object, with guarantees!

In practice, a usable bound can be extracted instantaneously for exact and quasi exact SDFs (50 queries). For more conservative functions where the SDF is a "bad" distance estimate (the distance is largely under estimated), then more iterations are required.

Sphere carving has the same general requirement than Sphere Tracing: as long as the function provides a conservative distance estimate (lower-bound), then the algorithm is guaranteed to converge to the shape.

Instead, Sphere carving iteratively approaches the surface by leveraging the SDF. Field function queries define a set of empty spheres, from which we extract intersection points that are used march towards the surface. The final point set has the property that the convex hull bounds the shape.

📜 New SIGGRAPH 2025 paper 🎉

❔How to compute bounding volumes for procedural Signed Distance Fields (SDFs)? This is not so trivial!

💡We propose a simple method called Sphere Carving. It extracts (convex) bounding volumes around SDFs, requires very few evaluations, and is GPU compatible.

Hitmen Party was developed by Newhead Studio, itself made of three friends that learned game dev together throughout the years 💻

It has a bunch of features - for instance, the ability to play with your phone as a gamepad, by just flashing a QR code! No need to have 8 controllers at home 🎮 📱