论文信息 - On the complexity of finding the convex hull of a set of points

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

Abstract An n log n lower bound is found for linear decision tree algorithms with integer inputs that either identify the convex hull of a set of points or compute its cardinality.

Davis Avis | D. Avis

[1] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[2] Bruce W. Weide,et al. On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[3] Peter van Emde Boas,et al. On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination , 1980, Inf. Process. Lett..

[4] David Avis,et al. Comments on a Lower Bound for Convex Hull Determination , 1980, Inf. Process. Lett..

[5] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.