Instant Transport Maps on 2D Grids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Graphics Year : 2018

Instant Transport Maps on 2D Grids


In this paper, we introduce a novel and extremely fast algorithm to compute continuous transport maps between 2D probability densities discretized on uniform grids. The core of our method is a novel iterative solver computing the L 2 optimal transport map from a grid to the uniform density in the 2D Euclidean plane. A transport map between arbitrary densities is then recovered through numerical inversion and composition. In this case, the resulting map is only approximately optimal, but it is continuous and density preserving. Our solver is derivative-free, and it converges in a few cheap iterations. We demonstrate interactive performance in various applications such as adaptive sampling, feature sensitive remeshing, and caustic design.
Fichier principal
Vignette du fichier
instant_ot_author_version_comp.pdf (16.13 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01884157 , version 1 (29-09-2018)



Georges Nader, Gael Guennebaud. Instant Transport Maps on 2D Grids. ACM Transactions on Graphics, 2018, 37 (6), pp.13. ⟨10.1145/3272127.3275091⟩. ⟨hal-01884157⟩
965 View
1076 Download



Gmail Mastodon Facebook X LinkedIn More