Divide-&-conquer in multidimensional space

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130841, Issue , 1976, Pages 220-230

  Bentley, Jon Louis ^a   Shamos, Michael Ian ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIVIDE-AND-CONQUER TECHNIQUE; GEOMETRIC PROBLEMS; MULTI-DIMENSIONAL SPACE; SPECIAL STRUCTURE; SUB-PROBLEMS;

COMPUTATION THEORY;

EID: 84977427380     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800113.803652     Document Type: Conference Paper

References (10)

1. Aho, A. V., Hopcroft, J. and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley (1973).
2. Bentley, J. L. and Friedman, J. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. SLAC Technical Report.
3. Blum, M., et al. "Time Bounds for Selection." JCSS 7 (1973), 448-461.
4. Kung, H. T., Luccio, F. and Preparata, F. P. "On Finding the Maxima of a Set of Vectors, " JACM 22 (1975), 469-476.
5. Preparata, F. P. and Hong, S. J. Convex Hulls of Finite Planar and Spatial Sets of Points. Report R-682, Coordinated Science Laboratory, University of Illinois (April, 1975).
6. Shamos, M. I. "Geometric Complexity." Proc. 7th Annual Symposium in Theory of Computing. May, 1975.
7. Shamos, M. I. "Geometry and Statistics: Problems at the Interface." Proc. Symposium on Algorithms and Complexity. Carnegie-Mellon University. April, 1975.
8. Shamos, M. I. Problems in Computational Geometry. Unpublished manuscript.
9. Shamos, M. I. and Hoey, D. J. "Closest-Point Problems." Proc. 16th Annual Symposium on Foundations of Computer Science. October, 1975.
10. Strong, H. R. Private communication.