>>3
why must you faggots talk of such things? get a list of points, use min/max functions 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 be talking about dijkstra heuristics, oh wait you covered the nearest neighbor estimation. why don't you do something useful and write some code that calculates distance from your house to my fist?