Multidimensional divide-and-conquer
- 1 April 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 23 (4) , 214-229
- https://doi.org/10.1145/358841.358850
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.Keywords
This publication has 15 references indexed in Scilit:
- Quintary treesACM Transactions on Database Systems, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Decomposable searching problemsInformation Processing Letters, 1979
- A near optimal data structure for a type of range query problemPublished by Association for Computing Machinery (ACM) ,1979
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975