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 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 betw...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on imaging sciences 2018-01, Vol.11 (2), p.1363-1389
Hauptverfasser:	Mérigot, Quentin, Meyron, Jocelyn, Thibert, Boris
Format:	Artikel
Sprache:	eng
Schlagworte:	Computational Geometry Computer Science Mathematics Numerical Analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!