orderMaxMinFast | R Documentation |
This is the O(n^2) algorithm for AMMD ordering. Start with a point in the middle, then propose a random set of the remaining points (of size 'numpropose') and choose the one that has maximum minimum distance to the already selected points. set 'numpropose' to n to get the exact maximum minimum distance ordering
orderMaxMinFast(locs, numpropose)
locs |
matrix of locations |
numpropose |
the number of locations to order |
orderinds a vector to order the locations
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.