2020
DOI: 10.1007/s00186-020-00703-z
|View full text |Cite
|
Sign up to set email alerts
|

Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

Abstract: 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 studie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 44 publications
0
21
0
Order By: Relevance
“…when one of both probabilities is supported on a discrete set. Such a problem has been studied in many contexts, including on resource allocation problem, points versus demand distribution, positions of sites such that the mean allocation cost is minimal ( [Hartmann and Schuhmacher, 2020]), resolution of the incompressible Euler equation using Lagrangian methods ( [Gallouët and Mérigot, 2018]), non-imaging optics; matching between a point cloud and a triangulated surface; seismic imaging ( [Meyron, 2019]), generation of blue noise distributions with applications for instance to low-level hardware implementation in printers ( [de Goes et al, 2012]), in astronomy ( [Lévy et al, 2020]). But in a more statistical point of view it can also be used to implement Goodness-of-fit-tests, in detecting deviations from a density map to have P = Q, by using the fluctuations of W(P n , Q), see [Hartmann and Schuhmacher, 2020] and to the new transport based generalization of the distribution function, proposed by [del Barrio et al, 2020], when the probability is discrete.…”
Section: Introductionmentioning
confidence: 99%
“…when one of both probabilities is supported on a discrete set. Such a problem has been studied in many contexts, including on resource allocation problem, points versus demand distribution, positions of sites such that the mean allocation cost is minimal ( [Hartmann and Schuhmacher, 2020]), resolution of the incompressible Euler equation using Lagrangian methods ( [Gallouët and Mérigot, 2018]), non-imaging optics; matching between a point cloud and a triangulated surface; seismic imaging ( [Meyron, 2019]), generation of blue noise distributions with applications for instance to low-level hardware implementation in printers ( [de Goes et al, 2012]), in astronomy ( [Lévy et al, 2020]). But in a more statistical point of view it can also be used to implement Goodness-of-fit-tests, in detecting deviations from a density map to have P = Q, by using the fluctuations of W(P n , Q), see [Hartmann and Schuhmacher, 2020] and to the new transport based generalization of the distribution function, proposed by [del Barrio et al, 2020], when the probability is discrete.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, semi-discrete optimal transport theory has seen significant expansion in its theoretical foundations (see [5,15,17,30,32,36,38,[42][43][44][45]). It has also been applied to many diverse problems in the sciences, both within fluid dynamics [28,37] and elsewhere such as materials science [6,7,33], economics [27,Chapter 5], crowd dynamics [34] and image interpolation [36].…”
Section: Sg In Geostrophic Coordinates and Semi-discrete Optimal Tran...mentioning
confidence: 99%
“…Moreover, ν ε is absolutely continuous with respect to the Lebesgue measure. Thus, according to Hartmann and Schuhmacher (2020), there exists w ε = (w ε1 , . .…”
Section: Kmentioning
confidence: 99%