pltc
banner
pltc.bsky.social
pltc
@pltc.bsky.social
plathc.github.io
Pinned
*Introduction post*
I’m a French researcher in computer graphics with a strong interest for pretty pictures and fast computation.
During my PhD, I worked for the illustration of large molecular systems (an example of which is attached, performed with a custom renderer) and Voronoï diagrams.
Reposted by pltc
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.
Graphics Replicability Stamp Initiative
www.replicabilitystamp.org
November 21, 2025 at 12:16 PM
Reposted by pltc
There's a new and very neat-looking SIGGRAPH Asia paper on constructing the swept volume based on the path of a moving (possibly deforming) object. Check it out!

https://jurwen.github.io/Swept-Volume-Page/
November 20, 2025 at 1:07 AM
Reposted by pltc
Here's a great video explaining/showing why the common CG practice of plugging smudge/fingerprints/dirt/whatever maps into roughness is wrong and why it should be done using material layering instead. This video is really well-made!

www.youtube.com/watch?v=OW4L...
Doing Surface Imperfections Right | Vray, Cycles, Arnold..
YouTube video by Lucas
www.youtube.com
November 20, 2025 at 8:35 AM
Reposted by pltc
apparently there are also native sdf nodes in blender 5 now
October 8, 2025 at 2:57 PM
Reposted by pltc
i wrote an efficient convolution reverb for dreams while at mm years ago, and found myself in need of one again. my memory was hazy on the details, and i couldnt find it written out in a simple way i could immediately understand, so i chewed a pencil and reminded myself. heres how i think about it
October 4, 2025 at 2:21 PM
Reposted by pltc
New blog post! In "Billions of triangles in minutes" we'll walk through hierarchical cluster level of detail generation of, well, billions of triangles in minutes. Reposts welcome!

zeux.io/2025/09/30/b...
September 30, 2025 at 5:40 PM
Reposted by pltc
Graphite's interactive "CosmoViewer". Explore your cosmologic simulations interactively !
September 29, 2025 at 10:00 PM
Reposted by pltc
Couple pieces about this work -

about the sphere packing, using voxel "dart throwing" on the GPU:
jbaker.graphics/writings/sph...

about the reuse of the data structure from the sphere packing, reinterpreting it as a grid-based raytracing acceleration structure:
jbaker.graphics/writings/dda...
September 29, 2025 at 12:07 PM
Reposted by pltc
Super proud to have been part of this work led by Sam Bourgault and Alejandro Aponte @ expressive computation lab

With WORM, we propose a new way to program cobot manufacturing actions through skilled manipulation and procedural repetitions

Checkout the paper and demo at #UIST2025
September 29, 2025 at 4:47 AM
Reposted by pltc
Large-scale semi-discrete optimal transport with distributed Voronoi diagrams,
Final version available here:
www.sciencedirect.com/science/arti...
September 26, 2025 at 8:15 AM
Reposted by pltc
Is #geogram's Constrained Delaunay Triangulation robust ?
... on the testbench !
github.com/BrunoLevy/ge...
September 24, 2025 at 7:50 PM
Reposted by pltc
RING meeting in Nancy,
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 !
September 18, 2025 at 8:48 AM
Reposted by pltc
Our article "Large-scale semi-discrete optimal transport with distributed Voronoi diagrams" (with Nicolas Ray, Quentin Merigot and Hugo Leclerc) just got accepted by Journal of Computational Physics. Pushing the limits of Optimal Transport by several orders of magnitude !
September 11, 2025 at 3:29 PM
Reposted by pltc
Reposted by pltc
New short post:
"Thinking about convolutions for graphics"
aschrein.github.io/jekyll/updat...
Thinking about convolutions for graphics
aschrein.github.io
August 22, 2025 at 4:06 PM
Reposted by pltc
Anyone here have experience PyPI packaging of custom nanobind bindings for CUDA code specifically? I'm fairly good at pybind/nanobind for standard C++ stuff, but I don't even know where to start for GPU code, especially one that links to Nvidia's proprietary libraries.

pls halp 🙏🙏🙏
August 18, 2025 at 1:35 PM
Reposted by pltc
🚀The code for Lipschitz Pruning is now online thanks to @wbrbr.bsky.social🚀

🔗 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!)
August 18, 2025 at 9:48 AM
Reposted by pltc
"By systematically contaminating inputs with NaN and observing which outputs become NaN, the method reconstructs conservative sparsity patterns that eliminate a major source of false negatives."

absolutely incredible, and also someone needs to stop these people

arxiv.org/abs/2507.23186
NaN-Propagation: A Novel Method for Sparsity Detection in Black-Box Computational Functions
When numerically evaluating a function's gradient, sparsity detection can enable substantial computational speedups through Jacobian coloring and compression. However, sparsity detection techniques fo...
arxiv.org
August 13, 2025 at 8:26 PM
Reposted by pltc
Playing with CSG engine, stress test, example_024 from OpenSCAD testsuite, but level 5 (instead of level 3 by default). Constrained Delaunay Triangulation goes brrr.
August 15, 2025 at 7:52 PM
Reposted by pltc
Presenting this paper tomorrow morning at 9:30am, during the Lightning Fast Geometry session⚡
Come check it out if you can!
📜 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.
August 13, 2025 at 11:48 PM
Reposted by pltc
Differentiable rendering has transformed graphics and 3D vision, but what about other fields? Our SIGGRAPH 2025 introduces misuka, the first fully-differentiable path tracer for acoustics.
August 12, 2025 at 7:27 PM
Reposted by pltc
At 3:45 PM tomorrow at SIGGRAPH, Lea Reichardt and Marco Manzi will present our part of the "Path Guiding in Production" course. Lea and Marco will talk about how we've been bridging cutting edge research into production in Disney's Hyperion Renderer.

s2025.conference-schedule.org/presentation...
Presentation - SIGGRAPH 2025 Conference Schedule
s2025.conference-schedule.org
August 11, 2025 at 9:26 PM
Reposted by pltc
I will be presenting the paper "Lipschitz Pruning: Hierarchical Simplification of Primitive-Based SDFs" at SIGGRAPH 2025 during the Best of Eurographics session! Come to my talk on Wednesday morning
wbrbr.org/publications...
Lipschitz Pruning: Hierarchical Simplification of Primitive-Based SDFs
wbrbr.org
August 11, 2025 at 12:46 AM
Reposted by pltc
📜 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.
August 5, 2025 at 3:02 PM
Reposted by pltc
I wrote this article explaining algorithms for physarum-style simulations
bleuje.com/physarum-exp...
Algorithms for making interesting organic simulations
Article explaining simulation algorithms that produce complex organic behaviours, starting with the classic physarum algorithm from Jeff Jones.
bleuje.com
July 13, 2025 at 9:14 PM