@Sormond I’ve taken a pass at your question on that other thread. I attempt to show how to generate catchment areas with SpiderWeb and then “optimize” them using a derivation of Llyod’s Algorithm adapted to graph networks. Instead of working purely spatially as in Lloyd’s, the centroid of the catchment in the graph network is found in each iteration.
1 Like