- 1 Avis, D. On the complexity of finding the convex hull of a set of points. Tech. Rep. SOCS 79.2, McGdl Umverslty, Montreal, Ontano, Canada, 1979Google Scholar
- 2 GRAHAM, R L An efficient algorithm for determining the convex hull of a t'mite set. Inf. Proc. Lea. 1 (1972), 132-133.Google Scholar
- 3 SHAMOS, M.I. Computational geometry. Tech. Pep., Computer Science Dep., Carnegie-Mellon Umv., Pmsburgh, Pa, May 1978.Google Scholar
- 4 VAN EMDE BOAS, P. On the f~(n log n) lower bound for convex hull and maxtmal vector determination. Inf. Proc. Left. 10 (1980), 132-136.Google Scholar
- 5 YAO, A C A lower bound to finding convex hulls. Tech Rep. STAN-CS-79-733, Computer Science Dep., Stanford, Univ., Stanford, Cahf., Apnl 1979. Google Scholar
Index Terms
- A Lower Bound to Finding Convex Hulls
Recommendations
New Algorithms for Bin Packing
In the bin-packing problem a list L of n numbers are to be packed into unit-capacity bins. For any algorithm S, let r(S) be the maximum ratio S(L)/L* for large L*, where S(L) denotes the number of bins used by S and L* denotes the minimum number needed. ...
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79: Proceedings of the eleventh annual ACM symposium on Theory of computingLet M = {0, 1, 2, ..., m—1} , N = {0, 1, 2,..., n—1} , and f:M × N → {0, 1} a Boolean-valued function. We will be interested in the following problem and its related questions. Let i ε M, j ε N be integers known only to two persons P1 and P2, ...
Comments