Multidimensional Binary Search Trees Used for Associative Searching¶
Bentley, J. L. (1975). Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9), 509-517.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Spatial Indexing
- The cheap geometric operation is built by recursively splitting the point set along alternating axes at the median, producing a balanced binary tree where each node owns an axis-aligned bounding box.
This sourceIntroduces the k-d tree: recursive median splits along alternating axes giving O(log n) nearest-neighbor and range queries in low dimensions via bounding-box pruning, with O(n log n) build cost.
- The cheap geometric operation is built by recursively splitting the point set along alternating axes at the median, producing a balanced binary tree where each node owns an axis-aligned bounding box.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:c2daa7ce452f · see in the full table