Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| 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@mathematik.uni-goettingen.de> |
| License | GPL (>= 2) |
| Version | 0.15-4 |
| URL | https://dschuhm1.pages.gwdg.de/software |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the transport package in your browser
Any scripts or data that you put into this service are public.
