Functions to convert a page of plots drawn with the
'graphics' package into identical output drawn with the 'grid' package.
The result looks like the original 'graphics'-based plot, but consists
of 'grid' grobs and viewports that can then be manipulated with
'grid' functions (e.g., edit grobs and revisit viewports).

Functions for drawing node-and-edge graphs that have been
laid out by graphviz.

c(person(given="Paul", family="Murrell",
email="p.murrell@auckland.ac.nz", role=c("cre","aut")),
person(given="Ashley Noel", family="Hinton",
email="ahin017@aucklanduni.ac.nz", role="aut"))
Functions for drawing node-and-edge graphs that have been
laid out by 'graphviz'.  This provides an alternative
rendering to that provided by the 'Rgraphviz' package, with
two main advantages:  the rendering provided by 'gridGraphviz'
should be more similar to what 'graphviz' itself would draw;
and rendering with 'grid' allows for post-hoc customisations
using the named viewports and grobs that 'gridGraphviz'
produces.
Paul Murrell [cre, aut],
Ashley Noel Hinton [aut]

Functions for drawing node-and-edge graphs that have been
laid out by graphviz.  This provides an alternative
rendering to that provided by the 'Rgraphviz' package, with
two main advantages:  the rendering provided by 'gridGraphviz'
should be more similar to what 'graphviz' itself would draw;
and rendering with 'grid' allows for post-hoc customisations
using the named viewports and grobs that 'gridGraphviz'
produces.

Approximate Optimal Transport Between Two-Dimensional Grids
c(person(given = "Michel", family = "Groppe", role = c("aut", "cre"),
email = "michel.groppe@stud.uni-goettingen.de"),
person(given = "Nicholas", family = "Bonneel", role = "ctb"),
person(given = "Egerváry Research Group on Combinatorial Optimization", role = "cph"))
Can be used for optimal transport between two-dimensional grids with respect to separable cost functions of l^p form. It utilizes the Frank-Wolfe algorithm to approximate so-called pivot measures: one-dimensional transport plans that fully describe the full transport, see G. Auricchio (2021) <arXiv:2105.07278>. For these, it offers methods for visualization and to extract the corresponding transport plans and costs. Additionally, related functions for one-dimensional optimal transport are available.
Michel Groppe [aut, cre],
Nicholas Bonneel [ctb],
Egerváry Research Group on Combinatorial Optimization [cph]