Fast linear expected-time algorithms for computing maxima and convex hulls

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 179-187

  Bentley, Jon L ^a   Clarkson, Kenneth L ^a   Levine, David B ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b WILLIAMS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

BOUNDARY PROBLEMS; EXPECTED COMPLEXITY; EXPECTED TIME; EXPERIMENTAL EVIDENCE; EXTREME POINTS; LEADING TERMS; LOWER BOUNDS; RUNNING TIME;

COMPUTATIONAL GEOMETRY;

EID: 85028870288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Becker, R. A., L. Denby, R. McGill and A. R. Wilks [1987]. "Analysis of data from the Places Rated Almanac", The American Statistician 41, 3, August 1987, pp. 169-186.
2. Bentley, J. L. [1980], "Multidimensional divide-andconquer", Communications of the Association for Computing Machinery 23, 4, April 1980, pp. 214-229.
3. Bentley, J. L., H. T. Kung, M. Schkolnick and C. D. Thompson [1978]. "On the average number of maxima in a set of vectors and applications". Journal of the Association for Computing Machinery 25, 4, October 1978, pp. 536-543.
4. Bentley, J. L. and M. I. Shamos [1978]. "Divide and conquer for linear expected time". Information Processing Letters 7, 2, February 1978, pp. 87-91.
5. Bentley, J. L., B. W. Weide and A. C. Yao [1980]. "Optimal expected-time algorithms for closest point problems", ACM Transactions on Mathematical Software 6, 4, pp. 563-580.
6. Boyer, R. and D. Savageau [1985]. Places Rated Almanac (Revised Edition), Rand McNally.
7. Clarkson, K. L. and P. W. Shor [1989]. "Applications of random sampling in computational geometry, II", to appear in Discrete and Computational Geometry.
8. Floyd, R. W. and R. L. Rivest [1975]. "Expected time bounds for selection". Communications of the ACM 18, 3, March 1975, pp. 165-172.
9. Golin, M. and R. Sedgewick [1988]. "Analysis of a simple yet efficient convex hull algorithm", Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 153-163.
10. Graham, R. L. [1972]. "An efficient algorithm for determining the convex hull of a finite planar point set", Information Processing Letters 1, pp. 132-133.
11. Kung. H. T., F. Luccio and F. P. Preparata [1975]. "On finding the maxima of a set of vectors". Journal of the Association for Computing Machinery 22, 4, October 1975, pp. 469-476.
12. Monier, L. [1980]. "Combinatorial solutions of multidimensional divide-and-conquer recurrences". Journal of Algorithms 1, 1, March 1980, pp. 60-74.
13. Preparata, F. P. and S. J. Hong [1977]. "Convex hulls of finite sets of points in two and three dimensions". Communications of the Association for Computing Machinery 20, 2, February 1977, pp. 87-93.
14. Preparata, F. P. and M. I. Shamos [1985]. Computational Geometry, Springer-Verlag.
15. Seidel, R. [1981]. "A convex hull algorithm optimal for points in even dimensions", M. S. Thesis, Technical Report 81-14, Department of Computer Science, University of British Columbia, Vancouver, Canada.
16. Urgel, J. [1989]. Private communication of Julio Urgel, Harvard Business School, April-May 1989.