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 Rd 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 2 and d. As in [Aurenhammer, Hoffman, Aronov… (More)


5 Figures and Tables