CRAN/E | SpatialKWD

SpatialKWD

Spatial KWD for Large Spatial Maps

Installation

About

Contains efficient implementations of Discrete Optimal Transport algorithms for the computation of Kantorovich-Wasserstein distances between pairs of large spatial maps (Bassetti, Gualandi, Veneroni (2020), doi:10.1137/19M1261195). All the algorithms are based on an ad-hoc 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 non-convex maps, the helper functions first build the convex-hull of the input bins and pad the weights with zeros.

System requirements C++11

Key Metrics

Version 0.4.0
Published 2021-05-07 940 days ago
Needs compilation? yes
CRAN checks SpatialKWD results

Downloads

Last 24 hours 0 -100%
Last 7 days 66 +50%
Last 30 days 245 -2%
Last 90 days 721 -6%
Last 365 days 2.973 +5%

Maintainer

Maintainer

Stefano Gualandi

stefano.gualandi@gmail.com

Authors

Stefano Gualandi

aut / cre

Material

Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

SpatialKWD archive

Imports

methods
Rcpp

LinkingTo

Rcpp