Description Usage Arguments Value References Examples
Function lazyGreedy
is an R wrapper for an efficient C++ implementation of the Lazy-Greedy spanning algorithm. The C++ implementation executes many thousands of times faster than a pure R implementation. Both the algorithm and (most of) the C++ implementation were developed by Quirijn W. Bouts, Alex P. ten Brink, and Kevin Buchin.
1 | lazyGreedy(V, t)
|
V |
a numeric n-by-2 matrix the ith row of which contains the location in R^2 of vertex i. |
t |
the desired dilation, a positive real number. |
Function lazyGreedy
returns a greedy t-spanner for the set of vertices V
. The result takes the form of an edge list.
Bouts, Q. W., ten Brink, A. P., and Buchin, K. (2014). A framework for computing the greedy spanner. In 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014) (pp. 11-19). Association for Computing Machinery, Inc.
1 2 3 4 5 6 7 8 9 10 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.