Convex hull and diameter of 2d point sets 1.1

Operating systemsOS : Windows / Linux / Mac OS / BSD / Solaris
Program licensingScript Licensing : Other Free / Open Source License - Python License
CreatedCreated : Jun 7, 2007
Size downloadDownloads : 2
Program licensing
Thank you for voting...

This script returns the convex hull (separated into ...

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 scripting tags: diameter, hull, point sets, vertices, points, order, convex hull, sorted, algorithm, convex hull algorithm, pairs. What is new in Convex hull and diameter of 2d point sets 1.1 software script? - Unable to find Convex hull and diameter of 2d point sets 1.1 news. What is improvements are expecting? Newly-made Convex hull and diameter of 2d point sets 1.2 will be downloaded from here. You may download directly. Please write the reviews of the Convex hull and diameter of 2d point sets. License limitations are unspecified.