Optimal Transport Approximation of Measures

Abstract : We propose a fast and scalable algorithm to project a given density on a set of structured measures. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are a natural generalization of previous results revolving around the generation of blue-noise point distributions, such as Lloyd's algorithm or more advanced techniques based on power diagrams. We provide a comprehensive convergence theory together with new approaches to accelerate the generation of point distributions. We also design new algorithms to project curves onto spaces of curves with bounded length and curvature or speed and acceleration. We illustrate the algorithm's interest through applications in advanced sampling theory, non-photorealistic rendering and path planning.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [58 references]  Display  Hide  Download

Contributor : Léo Lebrat <>
Submitted on : Monday, April 23, 2018 - 1:00:30 PM
Last modification on : Friday, April 12, 2019 - 4:22:51 PM
Document(s) archivé(s) le : Wednesday, September 19, 2018 - 3:12:48 AM


Files produced by the author(s)


  • HAL Id : hal-01773993, version 1


Frédéric de Gournay, Jonas Kahn, Léo Lebrat, Pierre Weiss. Optimal Transport Approximation of Measures. 2018. ⟨hal-01773993v1⟩



Record views


Files downloads