Baptiste GENEST
@baptiste-genest.bsky.social
Applied math and Geometry lover, discrete geometer wannabe. PhD Student at LIRIS.
he/him
he/him
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!
We introduce the first method to compute uv coordinates on implicit surfaces, without discretization, in real-time in a sphere-tracing pipeline!
It allows you to get full control over the appearance of the shape, with textures, without losing the benefits of implicit representations!
It allows you to get full control over the appearance of the shape, with textures, without losing the benefits of implicit representations!
May 10, 2025 at 6:20 PM
We introduce the first method to compute uv coordinates on implicit surfaces, without discretization, in real-time in a sphere-tracing pipeline!
It allows you to get full control over the appearance of the shape, with textures, without losing the benefits of implicit representations!
It allows you to get full control over the appearance of the shape, with textures, without losing the benefits of implicit representations!