emstreeR (Q81384)

From MaRDI portal
Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees
Language Label Description Also known as
English
emstreeR
Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees

    Statements

    0 references
    3.0.0
    21 March 2022
    0 references
    2.0.0
    3 December 2018
    0 references
    2.1.0
    6 December 2018
    0 references
    2.1.1
    20 January 2019
    0 references
    2.1.2
    17 March 2019
    0 references
    2.2.0
    8 May 2019
    0 references
    2.2.2
    30 November 2020
    0 references
    3.1.2
    14 November 2023
    0 references
    0 references
    14 November 2023
    0 references
    Fast and easily computes an Euclidean Minimum Spanning Tree (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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references