On the complexity of finding the convex hull of a set of points
- 30 April 1982
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 4 (2) , 81-86
- https://doi.org/10.1016/0166-218x(82)90065-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- Comments on a lower bound for convex hull determinationInformation Processing Letters, 1980
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978