The extendible cell method for closest point problems
From MaRDI portal
Publication:1161290
DOI10.1007/BF01934393zbMath0478.68059MaRDI QIDQ1161290
Publication date: 1982
Published in: BIT (Search for Journal in Brave)
68P10: Searching and sorting
Related Items
On search by address computation, Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees, Analysis of grid file algorithms, Implementation of the grid file: Design concepts and experience, Extendible hashing with overflow, Multidimensional quantile hashing is very efficient for nonuniform distributions, The average performance analysis of a closest‐pair algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order preserving extendible hashing and bucket tries
- Analysis of range searches in quad trees
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- Optimal Expected-Time Algorithms for Closest Point Problems
- An Algorithm for Finding Best Matches in Logarithmic Expected Time