+1Trying to find a way to find the maximum amount (highest density) of polygons with the rule
the polygons must be non-neighbouring. Essentially selecting a polygon and jump to the next polygon which is not neighbouring and so fort and so on until you encounter a neighbouring one.
See attached picture which I hand-picked.
Best answer by tva
Hi
Did you have a look at the FeatureColorSetter? https://docs.safe.com/fme/html/FME-Form-Documentation/FME-Transformers/Transformers/featurecolorsetter.htm
Especially the Color scheme: Map coloring. It should give a color id per group
This is a part off some clustered polygons:
And this whole workspace took 15.6 seconds at my side to complete so I find it a very convenient fast way for clustering (most time is taken up for reading/writing & topology building)
+13Hi
Did you have a look at the FeatureColorSetter? https://docs.safe.com/fme/html/FME-Form-Documentation/FME-Transformers/Transformers/featurecolorsetter.htm
Especially the Color scheme: Map coloring. It should give a color id per group
This is a part off some clustered polygons:
And this whole workspace took 15.6 seconds at my side to complete so I find it a very convenient fast way for clustering (most time is taken up for reading/writing & topology building)
