Artikel
Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
We consider the problem of finding an optimal transport plan between an absolutely continuous measure and a finitely supported measure of the same total mass when the transport cost is the unsquared Euclidean distance. We may think of this problem as closest distance allocation of some resource continuously distributed over Euclidean space to a finite number of processing sites with capacity constraints. This article gives a detailed discussion of the problem, including a comparison with the much better studied case of squared Euclidean cost. We present an algorithm for computing the optimal transport plan, which is similar to the approach for the squared Euclidean cost by Aurenhammer et al. (Algorithmica 20(1):61–76, 1998) and Mérigot (Comput Graph Forum 30(5):1583–1592, 2011). We show the necessary results to make the approach work for the Euclidean cost, evaluate its performance on a set of test cases, and give a number of applications. The later include goodness-of-fit partitions, a novel visual tool for assessing whether a finite sample is consistent with a posited probability density.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Mathematical Methods of Operations Research ; ISSN: 1432-5217 ; Volume: 92 ; Year: 2020 ; Issue: 1 ; Pages: 133-163 ; Berlin, Heidelberg: Springer
- Klassifikation
-
Wirtschaft
Consumer Protection
Economic History: Financial Markets and Institutions: General, International, or Comparative
- Thema
-
Monge–Kantorovich problem
Spatial resource allocation
Wasserstein metric
Weighted Voronoi tessellation
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Hartmann, Valentin
Schuhmacher, Dominic
- Ereignis
-
Veröffentlichung
- (wer)
-
Springer
- (wo)
-
Berlin, Heidelberg
- (wann)
-
2020
- DOI
-
doi:10.1007/s00186-020-00703-z
- Letzte Aktualisierung
-
10.03.2025, 11:46 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Hartmann, Valentin
- Schuhmacher, Dominic
- Springer
Entstanden
- 2020
Ähnliche Objekte (12)
Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
Euclidean Distance Degree and Mixed Volume
On distance preserving mapping of Euclidean-like planes
ON SOME PSEUDOSYMMETRY TYPE HYPERSURFACES OF SEMI-EUCLIDEAN SPACES
Semi-discrete isothermic surfaces
On Clustering Time Series Using Euclidean Distance and Pearson Correlation
Noisy Euclidean distance matrix completion with a single missing node
Distance Matters: a more than euclidean approach to visualizing gerrymandering
New Well-Posed boundary conditions for semi-classical Euclidean gravity
On Geodesic Completeness of Nondegenerate Submanifolds in Semi-Euclidean Spaces
Energy‐Efficient Memristive Euclidean Distance Engine for Brain‐Inspired Competitive Learning
Energy‐Efficient Memristive Euclidean Distance Engine for Brain‐Inspired Competitive Learning
Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
Euclidean Distance Degree and Mixed Volume
On distance preserving mapping of Euclidean-like planes
ON SOME PSEUDOSYMMETRY TYPE HYPERSURFACES OF SEMI-EUCLIDEAN SPACES
Semi-discrete isothermic surfaces
On Clustering Time Series Using Euclidean Distance and Pearson Correlation
Noisy Euclidean distance matrix completion with a single missing node
Distance Matters: a more than euclidean approach to visualizing gerrymandering
New Well-Posed boundary conditions for semi-classical Euclidean gravity
On Geodesic Completeness of Nondegenerate Submanifolds in Semi-Euclidean Spaces
Energy‐Efficient Memristive Euclidean Distance Engine for Brain‐Inspired Competitive Learning
Energy‐Efficient Memristive Euclidean Distance Engine for Brain‐Inspired Competitive Learning
Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
Euclidean Distance Degree and Mixed Volume
On distance preserving mapping of Euclidean-like planes
ON SOME PSEUDOSYMMETRY TYPE HYPERSURFACES OF SEMI-EUCLIDEAN SPACES
Semi-discrete isothermic surfaces
On Clustering Time Series Using Euclidean Distance and Pearson Correlation
Noisy Euclidean distance matrix completion with a single missing node
Distance Matters: a more than euclidean approach to visualizing gerrymandering
New Well-Posed boundary conditions for semi-classical Euclidean gravity
On Geodesic Completeness of Nondegenerate Submanifolds in Semi-Euclidean Spaces
Energy‐Efficient Memristive Euclidean Distance Engine for Brain‐Inspired Competitive Learning