Publisher review:Convex hull and diameter of 2d point sets script returns the convex hull and the diameter. This script returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y).
The convex hull algorithm is Graham's scan, using a coordinate-based sorted order rather than the more commonly seen radial sorted order.
A rotating calipers algorithm generates candidate pairs of vertices for the diameter calculation. Care was taken handling tricky cases such as pairs of points with the same x-coordinate and colinear triples of points.
Convex hull and diameter of 2d point sets 1.1 is a Python script for Programming Methods and Algorithms scripts design by David Eppstein.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
returns the convex hull and the diameter.
Operating system:Windows / Linux / Mac OS / BSD / Solaris
Convex hull and diameter of 2d point sets 1.1 script details 
