[PDF][PDF] A new convex hull algorithm for planar sets
WF Eddy - ACM Transactions on Mathematical Software (TOMS), 1977 - dl.acm.org
WF Eddy
ACM Transactions on Mathematical Software (TOMS), 1977•dl.acm.orgA new algorithm, CONVEX, that determines which points of a planar set are vertices of the
convex hull of the set is presented. It is shown that CONVEX operates in a fashion similar to
the sorting algorithm QUICKERSORT. Evidence is given which indicates that in some
situations CONVEX is preferable to earlier algorithms. A Fortran implementation, intended to
minimize execution time, is presented and an alternative, which minimizes storage
requirements, is discussed.
convex hull of the set is presented. It is shown that CONVEX operates in a fashion similar to
the sorting algorithm QUICKERSORT. Evidence is given which indicates that in some
situations CONVEX is preferable to earlier algorithms. A Fortran implementation, intended to
minimize execution time, is presented and an alternative, which minimizes storage
requirements, is discussed.
A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented. It is shown that CONVEX operates in a fashion similar to the sorting algorithm QUICKERSORT. Evidence is given which indicates that in some situations CONVEX is preferable to earlier algorithms. A Fortran implementation, intended to minimize execution time, is presented and an alternative, which minimizes storage requirements, is discussed.