Clustering points

[diff-arch]

Welcome @monikakali,

@monikakali

I would like to cluster the points but in clusters of predefinded number of members.

Check this out:

Cluster points: kangaroo, galapagos, python, space syntax

I’ve experimented a little and managed to come up with a similar result than your above sketch. Each cluster begins at a start point (closest point to each black point) and has a certain desired size. At each iteration the search radius is expanded by a step size and thus new closest points are found that are then added to the clusters. If a cluster has reached a desired size, or doesn’t find any new, closest points within a threshold, it stops expanding. [05] This has the unfortunate byprod…

It’s in Python though and 2D, but it’s easily translatable! Also not k-means, but does clustering in predefined size.