Linear decision trees are too weak for convex hull problem
- 13 June 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 12 (3) , 138-141
- https://doi.org/10.1016/0020-0190(81)90112-5
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- 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 computations under varying sets of primitivesJournal of Computer and System Sciences, 1979