transport: Computation of Optimal Transport Plans and Wasserstein Distances
Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet–Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.
Version: |
0.12-4 |
Depends: |
R (≥ 3.0.0) |
Imports: |
grDevices, graphics, methods, stats, Rcpp (≥ 0.12.10), data.table |
LinkingTo: |
RcppEigen, Rcpp |
Suggests: |
animation, ks, testthat |
Published: |
2022-08-12 |
Author: |
Dominic Schuhmacher [aut, cre],
Björn Bähre [aut] (aha and power diagrams),
Nicolas Bonneel [aut] (networkflow),
Carsten Gottschlich [aut] (simplex and shortlist),
Valentin Hartmann [aut] (semidiscrete1),
Florian Heinemann [aut] (transport_track and networkflow integration),
Bernhard Schmitzer [aut] (shielding),
Jörn Schrieber [aut] (subsampling),
Timo Wilm [ctb] (wpp) |
Maintainer: |
Dominic Schuhmacher <dominic.schuhmacher at mathematik.uni-goettingen.de> |
License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
URL: |
http://www.dominic.schuhmacher.name |
NeedsCompilation: |
yes |
Citation: |
transport citation info |
Materials: |
NEWS INSTALL |
CRAN checks: |
transport results |
Documentation:
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=transport
to link to this page.