My son just participated to a game jam. With a friend they created this puzzle game in 4 days ! owomelete.itch.io/catterplosion

Catterplosion by OwOmelete, wibix

Help Wiggle The Galaxy Swallower of Eternal Despair make his childrens become butterflys !

owomelete.itch.io

At the end of my internship at Adobe, we could not release code for numerous reasons. But I thought that the pseudo-code in the paper would be enough for anyone to re-implement it! I was wrong 🫠 @arezdev.de contacted me a week ago, asking why his implementation did not work...

Baptiste GENEST@baptiste-genest.bsky.social · last yr.

Implicit surfaces are great, but if you are not Inigo Quilez, it's really hard to control how they look... That's why I'm really proud to annonce our Eurographics 2025 paper: "Implicit UVs: Real-time semi-global parameterization of implicit surfaces".

My implementation of the paper "Implicit UVs: Real-time semi-global parameterization of implicit surfaces" from @baptiste-genest.bsky.social. The paper describes a way to texture SDFs in realtime by letting the user place seeds on the surface which get blended into a global UV space #godot #Graphics

Here we are, SIGGRAPH 2026! Don’t miss @baptiste-genest.bsky.social ´s tech paper talk “Uncertainty-aware geometry processing on Gaussian Process Implicit Surfaces” on Monday 11h45 (Room 403A) during the “Winding Numbers and Surface Representation” session

Wrong turn (1/3)

Today someone told me their hobby is "triangles"

The alpha version of my new book "Optimal Transport for Machine Learners" is out, with in particular an online version with interactive figures www.gpeyre.com/ot4ml/

I recently completed my PhD thesis, where I developed algorithms for making geometric inferences from imperfect data (i.e. incomplete and inaccurate observations/representations of shapes, like broken meshes or point clouds). A thread 🧵:

cseweb.ucsd.edu/~tzli/cool_r... I started to maintain a list of homepages of graphics academics who I think did cool work, are younger than me, and are not my current/past students. It's a living list so if I read any cool papers I'll add the authors to the list. I encourage you to do the same!

Yep I'm been playing with the BSP-OT solver and it is quite fast. The following interpolation is done on 300k samples and only takes a few seconds (but can only find permutations). Generating the GIF/animation is slower than solving the problem.

David Coeurjolly@dcoeurjo.bsky.social · 2mo ago

BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )

I'm *thrilled* to announce that: "MORE pictures of my cat" have been accepted for publication on *my website* 😻! baptiste-genest.github.io/toffee/ This is joint work with my girlfriend👏

Super happy and proud of this! Many thanks to @rflamary.bsky.social for his time and help 🙏 I'd strongly encourage anyone to contribute to the library, Rémy makes it easy! Check out the example: pythonot.github.io/master/auto_... !

David Coeurjolly@dcoeurjo.bsky.social · 2mo ago

BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )

BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )

GitHub - PythonOT/POT: POT : Python Optimal Transport

POT : Python Optimal Transport. Contribute to PythonOT/POT development by creating an account on GitHub.

github.com

Rémi Flamary @rflamary.bsky.social · 3mo ago

This is a very impressive method and it is coming shortly to the Python Optimal Transport toolbox! Thanks to the authors who contribute to open source toolboxes making them better. github.com/PythonOT/POT...

I'm extremely grateful to the award committee and to my awesome advisor @dcoeurjo.bsky.social !

David Coeurjolly@dcoeurjo.bsky.social · 2mo ago

Glad to share with you our SIGGRPAH 2026 paper which received a Best Paper Award (Honorable Mention) 🎉 Kudos @baptiste-genest.bsky.social ACM blog post: blog.siggraph.org/2026/05/beyo...

When dealing with noisy and/or partial inputs to describe a shape, the standard approach in geometry processing is to reconstruct a clean implicit surface first, and to do geometry on it. But why this one in particular? What about all the other surfaces that would have been coherent with the input?

#RésultatScientifique 🔎 | Des chercheurs du #LIRIS ont réalisé une avancée qui ouvre de nouvelles perspectives pour l’assignation de points en informatique graphique, en apprentissage automatique et au-delà. ➡️ www.ins2i.cnrs.fr/fr/cnrsinfo/... 🤝 @cnrs-rhoneauvergne.bsky.social

Transport optimal : une méthode simple et efficace pour des problèmes de grande taille

Des chercheurs du Laboratoire d'informatique en images et systèmes d'information

ins2i.cnrs.fr

#RésultatScientifique 🔎 | Des chercheurs du #LIRIS proposent une méthode plus rapide et plus précise en transport optimal discret. Une avancée qui ouvre de nouvelles perspectives. ➡️ www.ins2i.cnrs.fr/fr/cnrsinfo/... 🤝 @cnrs-rhoneauvergne.bsky.social

Transport optimal : une méthode simple et efficace pour des problèmes de grande taille

Des chercheurs du Laboratoire d'informatique en images et systèmes d'information

ins2i.cnrs.fr

This is a very impressive method and it is coming shortly to the Python Optimal Transport toolbox! Thanks to the authors who contribute to open source toolboxes making them better. github.com/PythonOT/POT...

[WIP] BSP-OT: Sparse transport plans between discrete measures in loglinear time by dcoeurjo · Pull Request #768 · PythonOT/POT

Initial fork and PR. (wip) Types of changes Original paper Motivation and context / Related issue How has this been tested (if it applies) PR checklist I have read the CONTRIBUTING documen...

github.com

CNRS Sciences informatiques@cnrsinformatics.bsky.social · 3mo ago

#RésultatScientifique 🔎 | Des chercheurs du #LIRIS proposent une méthode plus rapide et plus précise en transport optimal discret. Une avancée qui ouvre de nouvelles perspectives. ➡️ www.ins2i.cnrs.fr/fr/cnrsinfo/... 🤝 @cnrs-rhoneauvergne.bsky.social

For those interested in normalized gradient methods and optimal transport: I introduce a new class of "spectral" Wasserstein distances for which spectrally normalized gradient descent (Muon but without momentum and small step size ...) is a spectral-W gradient flow: arxiv.org/abs/2604.04891

Muon Dynamics as a Spectral Wasserstein Flow

Gradient normalization is central in deep-learning optimization because it stabilizes training and reduces sensitivity to scale. For deep architectures, parameters are naturally grouped into matrices ...

arxiv.org

I have procrastinated on writing so much that I wrote an entire document on writing tips: cseweb.ucsd.edu/~tzli/writin... Probably not much is new but I find I still need to repeat the same things to my students regularly. Will update this document over time hopefully.

Super happy and honored to share that our paper "BSP-OT: Sparse transport plans between discrete measures in log-linear time" won a *Best paper award* at SIGGRAPH Asia 2025! If you are here, come see my presentation about this work Wednesday afternoon! Many thanks to the award committee!

Baptiste GENEST@baptiste-genest.bsky.social · 10mo ago

Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… 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!

The Graphics Replicability Stamp Initiative (GRSI, www.replicabilitystamp.org), a community-driven initiative to promote replicability in Graphics research, is seeking volunteers. More details in the 'Volunteering' section of the home page.

Happy to share the excellent work of @baptiste-genest.bsky.social on making sliced optimal transport *much* better by replacing the sort along a line with a variant of QuickSort that directly takes multiples directions at once! It also directly provides a coupling between points.

Baptiste GENEST@baptiste-genest.bsky.social · 10mo ago

Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… 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!

Glad to share with you our last paper to be presented @ SIGGRAPH Asia 2025 ! Kudos @baptiste-genest.bsky.social

Baptiste GENEST@baptiste-genest.bsky.social · 10mo ago

Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… 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!

Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… 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!

"The greatest trick the Binomial ever pulled was convincing the world it didn't behave exactly as expected."

Vous avez sûrement déjà lu que la climatisation aggrave les canicules car l’air chaud rejeté à l’extérieur augmenterait la température des villes de 2 à 3°C. Vérifions ce que disent vraiment les études scientifiques à ce sujet 🧑‍🔬 (lisez jusqu’au bout, car vous allez être 🤯🤯 à la fin) #Thread ⬇️⬇️

📜 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.

OPEN SCIENCE IS THE FUTURE! Very pleased to see the Association for Computing Machinery (ACM — the parent organization to my “home” conference SIGGRAPH) has announced it is transitioning to full open access by January 2026!! #ACM #open #access #science #publication #journal #compsci

Open Access Publication & ACM

Open Access Publication & ACM

acm.org

I am glad to attend #HPG2025 where I just presented our paper "Fused Collapsing for Wide BVH Construction", co-authored with Mathias Paulin. We propose a fast build algorithm for wide BVHs that directly computes a wide hierarchy without additional collapsing pass. Webpage: wbrbr.org/publications...