Package: emstreeR
Type: Package
Title: Tools for Fast Computing and Visualizing Euclidean Minimum
        Spanning Trees
Version: 3.2.0-1
Date: 2026-08-03
Authors@R: c(
    person(given="Allan", family="Quadros", email = "allanvcq@gmail.com",
    role = c("aut", "cre")),
    person(given="Duncan", family="Garmonsway", email = "nacnudus@gmail.com",
    role = c("ctb"))
    )
Description: Fast and easy computation of Euclidean Minimum Spanning
        Trees (EMST) from data, relying on the R API for 'mlpack' - the
        C++ Machine Learning Library (Curtin et. al., 2013). 'emstreeR'
        uses the Dual-Tree Boruvka (March, Ram, Gray, 2010,
        <doi:10.1145/1835804.1835882>), which is theoretically and
        empirically the fastest algorithm for computing an EMST. This
        package also provides functions and an S3 method for readily
        visualizing Minimum Spanning Trees (MST) using either the style
        of the 'base', 'scatterplot3d', or 'ggplot2' libraries; and
        functions to export the MST output to shapefiles.
License: BSD_3_clause + file LICENSE
Encoding: UTF-8
Imports: mlpack, scatterplot3d, ggplot2, graphics, stats, sf, utils
Depends: R (>= 3.5.0)
BugReports: https://github.com/allanvc/emstreeR/issues/
RoxygenNote: 7.2.3
Config/pak/sysreqs: libabsl-dev cmake libgdal-dev gdal-bin libgeos-dev
        libssl-dev libproj-dev libsqlite3-dev libudunits2-dev
Repository: https://allanvc.r-universe.dev
Date/Publication: 2026-08-03 15:54:15 UTC
RemoteUrl: https://github.com/allanvc/emstreer
RemoteRef: HEAD
RemoteSha: c37b122e8fcf4384c12eb599be5a87ed18d71534
NeedsCompilation: no
Packaged: 2026-10-07 11:19:16 UTC; root
Author: Allan Quadros [aut, cre],
  Duncan Garmonsway [ctb]
Maintainer: Allan Quadros <allanvcq@gmail.com>