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.
- Version0.15-4
- R version≥ 4.1
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- transport citation info
- Last release09/16/2024
Documentation
Team
Dominic Schuhmacher
MaintainerShow author detailsBjörn Bähre
Show author detailsRolesAuthorNicolas Bonneel
Show author detailsRolesAuthorCarsten Gottschlich
Show author detailsRolesAuthorValentin Hartmann
Show author detailsRolesAuthorFlorian Heinemann
Show author detailsRolesAuthorBernhard Schmitzer
Show author detailsRolesAuthorJörn Schrieber
Show author detailsRolesAuthorTimo Wilm
Show author detailsRolesContributor
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports2 packages
- Suggests3 packages
- Linking To2 packages
- Reverse Imports10 packages
- Reverse Suggests2 packages