A Multiscale Approach to Optimal Transport

In this paper, we propose an improvement of an algorithm of Aurenhammer, Hoffmann and Aronov to find a least square matching between a probability density and finite set of sites with mass constraints, in the Euclidean plane. Our algorithm exploits the multiscale nature of this optimal transport pro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computer graphics forum Jg. 30; H. 5; S. 1583 - 1592
1. Verfasser:	Merigot, Quentin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford, UK Blackwell Publishing Ltd 01.08.2011 Wiley
Schlagworte:	Algorithms and systems Computational Geometry Computer Science Density I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems languages Least squares method Mathematical analysis Mathematical models Numerical Analysis Optimization Planes Studies Transport Transportation problem (Operations research) optimal transport convex programming Power diagram wasserstein distance
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!