//
sign in
Profile
by @danabra.mov
Profile
by @dansshadow.bsky.social
Profile
by @jimpick.com
AviHandle
by @danabra.mov
AviHandle
by @dansshadow.bsky.social
AviHandle
by @katherine.computer
EventsList
by @katherine.computer
ProfileHeader
by @dansshadow.bsky.social
ProfileHeader
by @danabra.mov
ProfileMedia
by @danabra.mov
ProfilePlays
by @danabra.mov
ProfilePosts
by @danabra.mov
ProfilePosts
by @dansshadow.bsky.social
ProfileReplies
by @danabra.mov
Record
by @atsui.org
Skircle
by @danabra.mov
StreamPlacePlaylist
by @katherine.computer
+ new component
Profile
Loading...
Research Director at @cnrs.fr and @LIRISLyon, PEPR ICCARE https://pepr-iccare.fr, GdR IG-RV https://gdr-igrv.fr, GRSI https://www.replicabilitystamp.org, digital geometry DGtal.org @dgtal.bsky.social, geometry processing, computer graphics and geek stuff
David Coeurjolly








Loading...
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...
17d
David Coeurjolly
BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )
Looking forward to see you in Aachen and/or Los Angeles!
6d
1mo
David Coeurjolly
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.
POT : Python Optimal Transport. Contribute to PythonOT/POT development by creating an account on GitHub.
GitHub - PythonOT/POT: POT : Python Optimal Transport
github.com
SIGGRAPH goes to #FAccT2026! Congrats to my co-authors @posada.website, @avmenon.bsky.social and @bsky.alexaschor.com We analyzed every SIGGRAPH, ToG, and SIGGRAPH Asia paper from 1974-2024 to see how race is imagined in graphics research. The results were not good. arxiv.org/abs/2605.14835 1/
5d
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_... !
23d
pltc
6d
Video
#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
#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
Computer graphics algorithms for generating photorealistic imagery are widely perceived to be universal, and capable of conjuring anything that a filmmaker or game designer can imagine. However, recen...
arxiv.org
The Racial Character of Computer Graphics Research
1mo
1mo
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...
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...
BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )
Rémi Flamary
Des chercheurs du Laboratoire d'informatique en images et systèmes d'information
www.ins2i.cnrs.fr
Transport optimal : une méthode simple et efficace pour des problèmes de grande taille
1mo
1mo
Theodore Kim
6d
Baptiste GENEST
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
[WIP] BSP-OT: Sparse transport plans between discrete measures in loglinear time by dcoeurjo · Pull Request #768 · PythonOT/POT
Rémi Flamary
Rémi Flamary
CNRS Sciences informatiques
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
[WIP] BSP-OT: Sparse transport plans between discrete measures in loglinear time by dcoeurjo · Pull Request #768 · PythonOT/POT
CNRS Sciences informatiques
David Coeurjolly
POT : Python Optimal Transport. Contribute to PythonOT/POT development by creating an account on GitHub.
github.com
GitHub - PythonOT/POT: POT : Python Optimal Transport
#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
Explore uncertainty-aware geometry processing on Gaussian Process Implicit Surfaces (GPIS), a SIGGRAPH 2026 Technical Paper on computing with noisy, incomplete, and uncertain shapes.
blog.siggraph.org
Beyond Deterministic Surfaces: Uncertainty-Aware Geometry Processing - ACM SIGGRAPH Blog
1mo
#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
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...
1mo
1mo
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
www.ins2i.cnrs.fr
CNRS Sciences informatiques
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
www.ins2i.cnrs.fr
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?
CNRS Sciences informatiques
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
[WIP] BSP-OT: Sparse transport plans between discrete measures in loglinear time by dcoeurjo · Pull Request #768 · PythonOT/POT
Rémi Flamary
17d
#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
1mo
Baptiste GENEST
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
www.ins2i.cnrs.fr
pythonot.github.io
CNRS Sciences informatiques
BSP-OT is now available in POT main branch! github.com/PythonOT/POT (👏 @baptiste-genest.bsky.social )
6d
Des chercheurs du Laboratoire d'informatique en images et systèmes d'information
www.ins2i.cnrs.fr
Transport optimal : une méthode simple et efficace pour des problèmes de grande taille
POT : Python Optimal Transport. Contribute to PythonOT/POT development by creating an account on GitHub.
github.com
GitHub - PythonOT/POT: POT : Python Optimal Transport
David Coeurjolly
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...
1mo
We will give with Cyprien Plateau-Holleville a course on Fluid Simulation with Optimal Transport: New and Old at: - Eurographics 2026 (May 4-8, Aachen) - SIGGRAPH 2026 (July 19-23, LA) Featuring: - Gentle introduction to OT - Create your own OT at home - Fluid sim with OT See you there !
Rémi Flamary
[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
1mo
#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
1mo
www.ins2i.cnrs.fr
Des chercheurs du Laboratoire d'informatique en images et systèmes d'information
Transport optimal : une méthode simple et efficace pour des problèmes de grande taille
CNRS Sciences informatiques
Video
Bruno Levy