Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
William F. Eddy (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: