Convex hull and diameter of 2d point sets

Convex hull and diameter of 2d point sets 1.1

Convex hull and diameter of 2d point sets 1.1 Download Summary

  • Language: Python
  • Platform: Windows / Linux / Mac OS / BSD / Solaris
  • License: Other Free / Open Source License - Python License
  • Databases: N/A
  • Downloads: 628
  • Released: Jun 7, 2007

Convex hull and diameter of 2d point sets 1.1 Description

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 Keywords

Convex hull and diameter of 2d point sets Bookmark

Hyperlink code:
Hyperlink for Forum code:

Convex hull and diameter of 2d point sets 1.1 Script Download Notice

Top 4 Download periodically updates information of Convex hull and diameter of 2d point sets 1.1 script from the developer, but some information may be slightly out-of-date.

Our script download links are directly from our mirrors or publisher's website. Convex hull and diameter of 2d point sets 1.1 torrent files or shared files from free file sharing and free upload services, including Rapidshare, MegaUpload, YouSendIt, MailBigFile, DropSend, HellShare, HotFile, FileServe, MediaMax, zUpload, MyOtherDrive, SendSpace, DepositFiles, Letitbit, LeapFile, DivShare or MediaFire, are not allowed!

Finding the convex hull of a set of 2D points

This simple code calculates the convex hull of a set of 2D points and generates EPS files to visualise them. ...
Python

Grouping objects into disjoint sets

... way to group arbitrary objects together into disjoint sets when a full-blown graph data structure would be ... joined using .join(), tested for connectedness using joined(), and all disjoint sets can be retreived using get(). The objects being ...
Python

All k subsets from an n set

... n. There are two methods. The first operates on sets of integers of the form range(n). The seconds operates on arbitrary sets or lists. ...
Python

Implementation of sets using sorted lists

... on the underlying data patterns. - Non-overlapping sets get united, intersected, or differenced with only log(N) ... can be expensive. - Natural support for sets of sets. No special accomodation needs to be made to ... potentially N log(N) comparisons. - Membership testing and element addition use log(N) comparisons. Element addition uses ...
Python

Binary floating point summation

This script eliminates completely  rounding errors and loss of significance due to catastrophic cancellation during summation. It  achieves exactness by keeping full precision intermediate subtotals. Offers three alternative approaches, each using a different technique to store exact subtotals. ach >using/ ...
Python