CRAN/E | transport

transport

Computation of Optimal Transport Plans and Wasserstein Distances

Installation

About

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.

Citation transport citation info
dschuhm1.pages.gwdg.de/software

Key Metrics

Version 0.15-0
R ≥ 3.0.0
Published 2024-03-26 28 days ago
Needs compilation? yes
License GPL-2
License GPL-3
CRAN checks transport results

Downloads

Yesterday 12 0%
Last 7 days 288 -37%
Last 30 days 1.768 +5%
Last 90 days 5.291 +35%
Last 365 days 18.591 +22%

Maintainer

Maintainer

Dominic Schuhmacher

dominic.schuhmacher@mathematik.uni-goettingen.de

Authors

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)

Material

NEWS
INSTALL
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

transport archive

Depends

R ≥ 3.0.0

Imports

grDevices
graphics
methods
stats
Rcpp ≥ 0.12.10
data.table

Suggests

animation
ks
testthat
WSGeometry

LinkingTo

RcppEigen
Rcpp

Reverse Imports

corral
cylcop
drf
Ecume
epiphy
GMPro
kanjistat
LOMAR
nearBynding
optimalFlow
otinference
phemd
SBCK
WSGeometry

Reverse Suggests

approxOT
provenance
WpProj