Multidimensional divide-and-conquer

Abstract

Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss multidimensional divide-and-conquer, an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems. We use this paradigm to give best-known solutions to such problems as the ECDF, maxima, range searching, closest pair, and all nearest neighbor problems. The contributions of the paper are on two levels. On the first level are the particular algorithms and data structures given by applying the paradigm. On the second level is the more novel contribution of this paper: a detailed study of an algorithmic paradigm that is specific enough to be described precisely yet general enough to solve a wide variety of problems.

References

1. 1 Aho, AV., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. 2 Bentley, J.L. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (Sept. 1975), 509-517.
3. 3 Bentley, J.L. Divide and conquer algorithms for closest point problems in multidimensional space. Unpublished Ph.D. dissertation, Univ. of North Carolina, Chapel Hill, N.C., 1976.
4. 4 Bentley, J.L. Decomposable searching problems. Inform. Proc. Letters 8, 5 (June 1979), 244-251.
5. 5 Bentley, J.L., and Friedman, J.H. Algorithms and data structures for range searching. Comptng. Surv. 11, 4 (Dec. 1979), 397-409.
6. 6 Bentley, J.L., Kung, H.T., Schkolnick, M., and Thompson, C.D. On the average number of maxima in a set of vectors and applications. J. ACM 25, 4 (Oct. 1978), 536-543.
7. 7 Bentley, J.L., and Maurer, H.A. Efficient worst-case data structures for range searching. To appear in Acta lnformatica (1980).
8. 8 Bentley, J.L., and Shamos, M.I. Divide and conquer in multidimensional space. In Proc. ACM Symp. Theory of Comptng., May 1976, pp. 220-230.
9. 9 Bentley, J.L., and Shamos, M.I. A problem in multivariate statistics: Algorithm, data structure, and applications. In Proc. 15th Allerton Conf. Communication, Control, and Comptng., Sept. 1977, pp. 193-201.
10. 10 Blum, M., et al. Time bounds for selection. J. Comptr. Syst. Sci. 7, 4 (Aug. 1972), 448--461.
11. 11 Dobkin, D., and Lipton, R.J. Multidimensional search problems. SIAM J. Comptng. 5, 2 (June 1976), 181-186.
12. 12 Fredman, M. A near optimal data structure for a type of range query problem. In Proc. 1 lth ACM Symp. Theory of Comptng., April 1979, pp. 62-66.
13. 13 Fredman, M., and Weide, B.W. On the complexity of computing the measure of O {ai, bi}. Comm. ACM 21, 7 (July 1978), 540-544.
14. 14 Friedman, J.H. A recursive partitioning decision rule for nonparametric classification. 1EEE Trans. Comptrs. C-26, 4 (April 1977), 404--408.
15. 15 Friedman, J. H. A nested partitioning algorithm for numerical multiple integration. Rep. SLAC-PUB-2006, Stanford Linear Accelerator Ctr., 1978.
16. 16 Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
17. 17 Kung, H.T., Luccio, F., and Preparata, F.P. On finding the maxima of a set of vectors. J. A CM 22, 4 (Oct. 1975), 469-476.
18. 18 Lee, D.T., and Wong, C.K. Qintary trees: A file structure for multidimensional database systems. To appear in ACM Trans. Database Syst.
19. 19 Lipton, R., and Tarjan, R.E. Applications of a planar separator theorem. In Proc. 18th Symp. Foundations of Comptr. Sci., Oct. 1977, pp. 162-170.
20. 20 Lueker, G. A data structure for orthogonal range queries. In Proc. 19th Symp. Foundations of Comptr. Sci., Oct. 1978, pp. 28-34.
21. 21 Monier, L. Combinatorial solutions of multidimensional divideand-conquer recurrences. To appear in the J. of Algorithms.
22. 22 Murray, J.A. Lieutenant, Police Department--The Complete Study Guide for Scoring High (4th ed.). Arco, New York, 1966, p. 184, question 3.
23. 23 Reddy, D.R., and Rubin, S. Representation of three-dimensional objects. Carnegie-Mellon Comptr. Sci. Rep. CMU-CS-78-113, Carnegie-Mellon Univ., Pittsburgh, Pa., 1978.
24. 24 Saxe, J.B. On the number of range queries in k-space. Discrete Appl. Math. 1, 3 (Nov. 1979), 217-225.
25. 25 Shamos, M.I. Computational geometry. Unpublished Ph.D. dissertation, Yale Univ., New Haven, Conn., 1978.
26. 26 Shamos, M.I. Geometric complexity. In Proc. 7th ACM Symp. Theory of Comptng., May 1975, pp. 224-233.
27. 27 Weide, B. A survey of analysis techniques for discrete algorithms. Comptng. Surv. 9, 4 (Dec. 1977), 291-313.
28. 28 Willard, D.E. New data structures for orthogonal queries. Harvard Aiken Comptr. Lab. Rep., Cambridge, Mass., 1978.
29. 29 Yao, F.F. On f'mding the maximal elements in a set of planar vectors. Rep. UIUCDCS-R-74-667, Comptr. Sci. Dept., Univ. of Illinois, Urbana, July 1974.

Index Terms

• Theory of computation

  • Design and analysis of algorithms

    • Data structures design and analysis

      • Sorting and searching

  • Randomness, geometry and discrete structures