The extendible cell method for closest point problems

DOI10.1007/BF01934393zbMath0478.68059MaRDI QIDQ1161290

Markku Tamminen

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

multidimensional searchorder preserving extendible hashing22, 27-41 (1982)

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Extendible hashing with overflow ⋮ The average performance analysis of a closest‐pair algorithm ⋮ Multidimensional quantile hashing is very efficient for nonuniform distributions ⋮ Analysis of grid file algorithms ⋮ On search by address computation ⋮ Implementation of the grid file: Design concepts and experience

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

This page was built for publication: The extendible cell method for closest point problems