Data Structures and Algorithms for Relations

Data structures and algorithms for k-ary relations with
  arbitrary domains, featuring relational algebra, predicate functions,
  and fitters for consensus relations.

c(person(given = "David", family = "Meyer", role = c("aut")),
             person(given = "Kurt", family = "Hornik", role = c("aut", "cre"),
                    email = "Kurt.Hornik@R-project.org",
		    comment = c(ORCID = "0000-0003-4198-9911")),
             person(given = "Christian", family = "Buchta", role = "ctb"))

cluster, stats, slam, sets (>= 1.0-16), graphics, grDevices

David Meyer [aut],
  Kurt Hornik [aut, cre] (<https://orcid.org/0000-0003-4198-9911>),
  Christian Buchta [ctb]

c(person(given = "Hadley",
             family = "Wickham",
             role = c("aut", "cre"),
             email = "hadley@rstudio.com"),
      person(given = "Dana",
             family = "Seidel",
             role = "aut"),
      person(given = "RStudio",
             role = "cph"))

Graphical scales map data to aesthetics, and
    provide methods for automatically determining breaks and labels for
    axes and legends.

farver (>= 2.0.3), labeling, lifecycle, munsell (>= 0.5), R6,
RColorBrewer, viridisLite

bit64, covr, dichromat, ggplot2, hms (>= 0.5.0), testthat (>=
2.1.0)

Hadley Wickham [aut, cre],
  Dana Seidel [aut],
  RStudio [cph]

Fast Nearest Neighbour Search (Wraps ANN Library) Using L2
Metric

Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis

ANN library is copyright University of Maryland and Sunil
Arya and David Mount. See file COPYRIGHT for details.

Finds the k nearest neighbours for every point in a given dataset
    in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is
    support for approximate as well as exact searches, fixed radius searches
    and 'bd' as well as 'kd' trees. The distance is computed using the L2
    (Euclidean) metric. Please see package 'RANN.L1' for the same
    functionality using the L1 (Manhattan, taxicab) metric.