Detect a new 'planting' and tag all trees as belonging to this unit. This GIS algorithm helps to solve the Update and Duplicate issues.
A new planting would be a cluster of trees (of any total size) that appears within a limited time range.
[ ] define a metric for how far away a new clusters have to be from one another to be considered separate.
It's more complex that just KNN or the cluster strategies we use for the web map currently, because plantings can be all shapes and sizes (grids, borders of land, following roads). There's a few more details to it but this is the gist, this would be useful for our web map since we could label the plantings, and also useful for update detection.
"These would be like 'packs of trees' confined by time/location. So like a day and 5000 meters?"
"No, more complicated than than. more like detecting an area that is part of a coordinated planing effort."
SebastianGer
commented
4 years ago
This ticket is incomplete
Detect a new 'planting' and tag all trees as belonging to this unit. This GIS algorithm helps to solve the Update and Duplicate issues. A new planting would be a cluster of trees (of any total size) that appears within a limited time range.
It's more complex that just KNN or the cluster strategies we use for the web map currently, because plantings can be all shapes and sizes (grids, borders of land, following roads). There's a few more details to it but this is the gist, this would be useful for our web map since we could label the plantings, and also useful for update detection.
"These would be like 'packs of trees' confined by time/location. So like a day and 5000 meters?"
"No, more complicated than than. more like detecting an area that is part of a coordinated planing effort."