Spatial clusters with equal number of objects (2)
ClustGeo <https://arxiv.org/pdf/1707.03897.pdf> may be of interest, but most things I've seen in this space are in Python, like Clusterpy & the Python Spatial Analysis Library's MaxP algorithm. You can call it from R using reticulated.
On Tue, Oct 31, 2017 at 7:18 PM Tim Keitt <tkeitt at utexas.edu> wrote:
http://www.keittlab.org/ On Tue, Oct 31, 2017 at 5:57 AM, Maurizio Marchi < mauriziomarchi85 at gmail.com
wrote:
Hello everybody, is there an easy way to cluster spatial objects (polygons in my case, a grid of 500mx500m cells) with an equal number of objects per cluster?
If you mean maximally compact clusters, that is proven NP complexity, so you would have to resort to heuristic search or greedy approximations. One approach is to place points sequentially up to n with each point maximally distant from all previous points then assign nearest neighbors. I wonder if igraph has something that would suit the problem? THK I tried to attach an example of what I mean but I think the message was
never delivered.
Regards
--
Maurizio Marchi
Skype ID: maurizioxyz
linux user 552742
[[alternative HTML version deleted]]
_______________________________________________ R-sig-Geo mailing list R-sig-Geo at r-project.org https://stat.ethz.ch/mailman/listinfo/r-sig-geo
[[alternative HTML version deleted]]
_______________________________________________ R-sig-Geo mailing list R-sig-Geo at r-project.org https://stat.ethz.ch/mailman/listinfo/r-sig-geo
Levi John Wolf Lecturer in Quantitatve Human Geography | University of Bristol Associate Member | Center for Multilevel Modeling, University of Bristol Visiting Fellow | Center for Spatial Data Science, University of Chicago ljwolf.org [[alternative HTML version deleted]]