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

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 30; no. 5; pp. 1583 - 1592
Main Author:	Merigot, Quentin
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.08.2011 Wiley
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!