On the complexity of finding the convex hull of a set of points

@article{Avis1982OnTC,
title={On the complexity of finding the convex hull of a set of points},
author={Davis Avis},
journal={Discrete Applied Mathematics},
year={1982},
volume={4},
pages={81-86}
}

The problem of finding the convex hull of a set of n points in the plane has received considerable attention in the recent literature. Although algorithms with running time’ O(n log n) have been known for some time [5], the proof of an Q(n log n) lower bound for this problem has been more elusive. Yao [7] has discovered such a bound for the powerful quadratic decision tree model under the assumption that the input consists of infinite precision real numbers. A much simpler proof was discovered… CONTINUE READING