Contains efficient implementations of Discrete Optimal Transport algorithms for the computation of KantorovichWasserstein distances between pairs of large spatial maps (Bassetti, Gualandi, Veneroni (2020), <doi:10.1137/19M1261195>). All the algorithms are based on an adhoc implementation of the Network Simplex algorithm. The package has four main helper functions: compareOneToOne() (to compare two spatial maps), compareOneToMany() (to compare a reference map with a list of other maps), compareAll() (to compute a matrix of distances between a list of maps), and focusArea() (to compute the KWD distance within a focus area). In nonconvex maps, the helper functions first build the convexhull of the input bins and pad the weights with zeros.
Package details 


Author  Stefano Gualandi [aut, cre] 
Maintainer  Stefano Gualandi <stefano.gualandi@gmail.com> 
License  EUPL (>= 1.2) 
Version  0.4.0 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.