<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"><channel><description>Applied math and Geometry lover, discrete geometer wannabe. PhD Student at LIRIS.&#xA;he/him&#xA;&#xA;baptiste-genest.github.io</description><link>https://bsky.app/profile/baptiste-genest.bsky.social</link><title>@baptiste-genest.bsky.social - Baptiste GENEST</title><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3msq4aruxkk2l</link><description>I know nothing about GPU programming, so I thought that BSP-OT on the GPU would not work because we are recursive then sequential... &#xA;&#xA;I asked Claude to give it a try in CUDA:&#xA;&#xA;x10 speed-up 😳 0.4s for 350k points in 3D, with the same quality as the CPU 😱&#xA;&#xA;Here is the code: https://github.com/baptiste-genest/BSP-OT-CUDA/tree/main&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>10 Aug 2026 12:32 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3msq4aruxkk2l</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3mrkiu7dnoc25</link><description>At the end of my internship at Adobe, we could not release code for numerous reasons.&#xA;&#xA;But I thought that the pseudo-code in the paper would be enough for anyone to re-implement it!&#xA;&#xA;I was wrong 🫠&#xA;&#xA;@arezdev.de contacted me a week ago, asking why his implementation did not work...&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>26 Jul 2026 13:37 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3mrkiu7dnoc25</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3mnpc6j3ms22a</link><description>I&#39;m *thrilled* to announce that:&#xA;&#xA;&#34;MORE pictures of my cat&#34; have been accepted for publication on *my website* 😻!&#xA;&#xA;baptiste-genest.github.io/toffee/&#xA;&#xA;This is joint work with my girlfriend👏</description><pubDate>07 Jun 2026 13:40 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3mnpc6j3ms22a</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3mnp6xgouak2m</link><description>Super happy and proud of this!&#xA;&#xA;Many thanks to @rflamary.bsky.social  for his time and help 🙏 &#xA;&#xA;I&#39;d strongly encourage anyone to contribute to the library, Rémy makes it easy!&#xA;&#xA;Check out the example: &#xA;https://pythonot.github.io/master/auto_examples/plot_bsp_ot.html !&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>07 Jun 2026 12:42 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3mnp6xgouak2m</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3mmtm4tzb7225</link><description>I&#39;m extremely grateful to the award committee and to my awesome advisor @dcoeurjo.bsky.social !&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>27 May 2026 13:23 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3mmtm4tzb7225</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3mmtlceqbxk25</link><description>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.&#xA;But why this one in particular? What about all the other surfaces that would have been coherent with the input?</description><pubDate>27 May 2026 13:09 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3mmtlceqbxk25</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3m7yozhfq6k2l</link><description>Super happy and honored to share that our paper &#34;BSP-OT: Sparse transport plans between discrete measures in log-linear time&#34; won a *Best paper award* at SIGGRAPH Asia 2025! &#xA;&#xA;If you are here, come see my presentation about this work Wednesday afternoon!&#xA;&#xA;Many thanks to the award committee!&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>15 Dec 2025 03:31 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3m7yozhfq6k2l</guid></item><item><link>https://bsky.app/profile/baptiste-genest.bsky.social/post/3m256wlpsgs22</link><description>Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable…&#xA;&#xA;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!</description><pubDate>01 Oct 2025 13:55 +0000</pubDate><guid isPermaLink="false">at://did:plc:ia2a55zrh22gor73moijadrp/app.bsky.feed.post/3m256wlpsgs22</guid></item></channel></rss>