>>4 why must you faggots talk of such things? get a list of points use min/max func tions to determine the lowest left and then start going through the points in a counterclockwise motion until you end up at the original. next you're going to b e talking about dijkstra heuristics oh wait you covered the nearest neighbor es timation. why don't you do something useful and write some code that calculates distance from your house to my fist?