An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
We propose a numerical method to find the optimal transport map between a measure supported on a lower-dimensional subset of $\mathbb{R}^d$ and a finitely supported measure. More precisely, the source measure is assumed to be supported on a simplex soup, i.e., on a union of simplices of arbitrary dimension between …