Answers are grounded in this paper and cite their sources.
We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set and H is the size of the output set, i.e. the number of vertices found to be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the problem is measured in terms of input as well as output size. The algorithm relies on a variation of the divide-and-conquer paradigm which we call the "marriage-before-conquest" principle and which appears to be interesting in its own right.
No takes yet. Share an insight, caveat, or question.
Kirkpatrick et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: