Baptiste GENEST
@baptiste-genest.bsky.social
Applied math and Geometry lover, discrete geometer wannabe. PhD Student at LIRIS.
he/him
he/him
Pinned
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!
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!
Reposted by Baptiste GENEST
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.
More details in the 'Volunteering' section of the home page.
Graphics Replicability Stamp Initiative
www.replicabilitystamp.org
November 21, 2025 at 12:16 PM
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.
More details in the 'Volunteering' section of the home page.
Reposted by Baptiste GENEST
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.
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!
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!
October 1, 2025 at 1:59 PM
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.
Reposted by Baptiste GENEST
Glad to share with you our last paper to be presented @ SIGGRAPH Asia 2025 !
Kudos @baptiste-genest.bsky.social
Kudos @baptiste-genest.bsky.social
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!
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!
October 1, 2025 at 1:58 PM
Glad to share with you our last paper to be presented @ SIGGRAPH Asia 2025 !
Kudos @baptiste-genest.bsky.social
Kudos @baptiste-genest.bsky.social
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!
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!
October 1, 2025 at 1:55 PM
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!
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!
Reposted by Baptiste GENEST
"The greatest trick the Binomial ever pulled was convincing the world it didn't behave exactly as expected."
August 19, 2025 at 6:13 AM
"The greatest trick the Binomial ever pulled was convincing the world it didn't behave exactly as expected."
Reposted by Baptiste GENEST
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
⬇️⬇️
Vérifions ce que disent vraiment les études scientifiques à ce sujet 🧑🔬
(lisez jusqu’au bout, car vous allez être 🤯🤯 à la fin)
#Thread
⬇️⬇️
August 15, 2025 at 7:37 PM
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
⬇️⬇️
Vérifions ce que disent vraiment les études scientifiques à ce sujet 🧑🔬
(lisez jusqu’au bout, car vous allez être 🤯🤯 à la fin)
#Thread
⬇️⬇️
Reposted by Baptiste GENEST
📜 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.
❔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.
August 5, 2025 at 3:02 PM
📜 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.
❔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.
Reposted by Baptiste GENEST
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
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
www.acm.org
July 29, 2025 at 6:55 PM
Reposted by Baptiste GENEST
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...
Fused Collapsing for Wide BVH Construction
wbrbr.org
June 23, 2025 at 5:27 PM
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...
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".
That's why I'm really proud to annonce our Eurographics 2025 paper: "Implicit UVs: Real-time semi-global parameterization of implicit surfaces".
May 10, 2025 at 6:20 PM
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".
That's why I'm really proud to annonce our Eurographics 2025 paper: "Implicit UVs: Real-time semi-global parameterization of implicit surfaces".
Reposted by Baptiste GENEST
If you need to quickly setup a C++ geometry processing project mixing existing libs (polyscope, eigen, DGtal, cgal, geometry-central, libigl, directional…). I’m sharing with you my cmake recipes
github.com/dcoeurjo/Geo...
github.com/dcoeurjo/Geo...
GitHub - dcoeurjo/GeometryProcessing-cmake-recipes: CPM / cmake recipes for geometry processing stuff
CPM / cmake recipes for geometry processing stuff. Contribute to dcoeurjo/GeometryProcessing-cmake-recipes development by creating an account on GitHub.
github.com
November 20, 2024 at 7:51 AM
If you need to quickly setup a C++ geometry processing project mixing existing libs (polyscope, eigen, DGtal, cgal, geometry-central, libigl, directional…). I’m sharing with you my cmake recipes
github.com/dcoeurjo/Geo...
github.com/dcoeurjo/Geo...