https://h-schott.github.io
In our SIGGRAPH Asia 2025 paper: “BSP-OT: Sparse transport plans between discrete measures in log-linear time” we get one with typically 1% of error in a few seconds on CPU!
In our SIGGRAPH Asia 2025 paper: “BSP-OT: Sparse transport plans between discrete measures in log-linear time” we get one with typically 1% of error in a few seconds on CPU!
Cyprien Plateau--Holleville presented presented his awesome work on exact integration of the differential quantities involved in Partial Optimal Transport. And that's not all: It comes with a combined physsim - Optimal Transport - rendering on the GPU !
Cyprien Plateau--Holleville presented presented his awesome work on exact integration of the differential quantities involved in Partial Optimal Transport. And that's not all: It comes with a combined physsim - Optimal Transport - rendering on the GPU !
If you couldn’t make it, have a look at our project page!
💻 marzia-riso.github.io/iospp.html
Can’t wait for what’s next! 🎉
If you couldn’t make it, have a look at our project page!
💻 marzia-riso.github.io/iospp.html
Can’t wait for what’s next! 🎉
🔗 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!)
🔗 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!)
Vérifions ce que disent vraiment les études scientifiques à ce sujet 🧑🔬
(lisez jusqu’au bout, car vous allez être 🤯🤯 à la fin)
#Thread
⬇️⬇️
Vérifions ce que disent vraiment les études scientifiques à ce sujet 🧑🔬
(lisez jusqu’au bout, car vous allez être 🤯🤯 à la fin)
#Thread
⬇️⬇️
Come check it out if you can!
❔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.
Come check it out if you can!
wbrbr.org/publications...
wbrbr.org/publications...
🔗 Code: github.com/H-Schott/Sph...
📽️ Video: www.youtube.com/watch?v=fekn...
🔗 Code: github.com/H-Schott/Sph...
📽️ Video: www.youtube.com/watch?v=fekn...
❔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.
❔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.
Et après il a rempli sa couche avec une parfaite imitation de François Bayrou.
Et après il a rempli sa couche avec une parfaite imitation de François Bayrou.
Come see our talk at #SIGGRAPH2025 to discuss how we can collectively move "Towards a sustainable use of GPUs in Graphics Research"
with @elie-michel.bsky.social @axelparis.bsky.social Octave Crespel and Felix Hähnlein
Come see our talk at #SIGGRAPH2025 to discuss how we can collectively move "Towards a sustainable use of GPUs in Graphics Research"
with @elie-michel.bsky.social @axelparis.bsky.social Octave Crespel and Felix Hähnlein
What if instead of two 6-sided dice, you could roll a single "funky-shaped" die that gives the same statistics (e.g, 7 is twice as likely as 4 or 10).
Or make fair dice in any shape—e.g., dragons rather than cubes?
That's exactly what we do! 1/n
What if instead of two 6-sided dice, you could roll a single "funky-shaped" die that gives the same statistics (e.g, 7 is twice as likely as 4 or 10).
Or make fair dice in any shape—e.g., dragons rather than cubes?
That's exactly what we do! 1/n
👉 The paper's page: wbrbr.org/publications...
Congrats to @wbrbr.bsky.social, M. Sanchez, @axelparis.bsky.social, T. Lambert, @tamyboubekeur.bsky.social, M. Paulin and T. Thonat!
👉 The paper's page: wbrbr.org/publications...
Congrats to @wbrbr.bsky.social, M. Sanchez, @axelparis.bsky.social, T. Lambert, @tamyboubekeur.bsky.social, M. Paulin and T. Thonat!
That's why I'm really proud to annonce our Eurographics 2025 paper: "Implicit UVs: Real-time semi-global parameterization of implicit surfaces".
That's why I'm really proud to annonce our Eurographics 2025 paper: "Implicit UVs: Real-time semi-global parameterization of implicit surfaces".
github.com/keenancrane/...
(This one will surely be broken too someday, but for now it works nicely 😛)
github.com/keenancrane/...
(This one will surely be broken too someday, but for now it works nicely 😛)
www.sciencedirect.com/science/arti...
www.sciencedirect.com/science/arti...