Multidimensional divide-and-conquer
Jon Louis Bentley · Communications of the ACM · 1980
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.
Cited by 672 works. doi:10.1145/358841.358850 Open-access PDF
Authors
References
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- Multidimensional binary search trees used for associative searching
- Sorting and Searching
- Time bounds for selection
- Geometric complexity
- Data Structures for Range Searching
- On Finding the Maxima of a Set of Vectors
- Multidimensional Searching Problems
- A Recursive Partitioning Decision Rule for Nonparametric Classification