Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

GIS algorithm - 'Detect New Plantings Clusters' #120

Open
1 task
Davidezrajay opened this issue Aug 6, 2020 · 1 comment
Open
1 task

GIS algorithm - 'Detect New Plantings Clusters' #120

Davidezrajay opened this issue Aug 6, 2020 · 1 comment

Comments

@Davidezrajay
Copy link
Contributor

Davidezrajay commented Aug 6, 2020

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.

  • 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
Copy link

I'm working on this

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants