Closest Pair of points problem in the planar case.
28 people like thisPosted: 7 years ago by Martin Szarski
finds the points lying on the convex hull of the given set of points and returns those points in clockwise direction, starting at the point with minimum y-value Remarks: it's a more or less direct implementation of the algorithm named after Ronald Graham that is explained on http://en.wikipedia.org/wiki/Graham_scan you can switch the definition Point for a proper type of your liking - e.g. System.Drawing.Point
39 people like thisPosted: 7 years ago by Carsten König