Finding the convex hull of a set of points is the most elementary interesting problem in computational geometry, just as minimum spanning tree is the most elementary interesting problem in graph algorithms. It arises because the hull quickly captures a rough idea of the shape or extent of a data set.

Convex hull also serves as a first preprocessing step to many, if not most, geometric algorithms. For example, consider the problem of finding the diameter of a set of points, which is the pair of points a maximum distance apart. The diameter will always be the distance between two points on the convex hull. The O(n \lg n). algorithm for computing diameter proceeds by first constructing the convex hull, then for each hull vertex finding which other hull vertex is farthest away from it. This so-called ``rotating-calipers'' method can be used to move efficiently from one hull vertex to another.

Please check attached the images and source.zip file
convex-hull-L.jpg convex-hull-R.jpg

Attached Files

source.zip (3.1 KB, 9 views)

__________________
The KINGMAKER
Makes Every Thing Possible

Stuffs (My Blog)

thanks...i have used this algorithm for joining Latitude and Logitude Points

__________________
The MOSS
Master of Solution Service