Check all tree neighborhoods and merge TreeIDs which are too close in a
treeMap.merge(map, d = 0.2)
object generated by
d parameter is a relative measure of close neighbors. Sorting all possible pairs by distance from a tree map,
the merge criterion is that none of the closest pairs should be distant less than the next closest pair's distance minus
This method is useful when merging forked stems or point clusters from plots with too much understory, especially if those are
from forest stands with regularly spaced trees.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.