AB And Arob <| sep |> Yes . As far as I can tell , the distances between clusters or any other geometry at worst can be fractals of the worst case , and if that wasn ' t the case then the greediest heuristics wouldn ' t always come down to 2 optimal . I do see what you mean about 2 n 10 and I think this would come down to On 2 2 n 3320 in the worst case . I can see a regular spiral shape of points where most additions could fall under the prune to approach this complexity . I would need to learn how to program a bit better to implement this myself , this is not my area of expertise though I understand the concepts of programming well enough to know what I propose is possible . Thank you for the insight , it ' s much appreciated .