On the Ω(n log n) lower bound for convex hull and maximal vector determination
- 18 April 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 10 (3), 132-136
- https://doi.org/10.1016/0020-0190(80)90064-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975
- On the computational complexity of finding the maxima of a set of vectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972