Analysis of range searches in quad trees

DOI10.1016/0020-0190(75)90034-4zbMath0304.68039OpenAlexW2120252669MaRDI QIDQ1216951

Donald F. Stanat, Jon Louis Bentley

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90034-4

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (6)

Order preserving extendible hashing and bucket tries ⋮ The extendible cell method for closest point problems ⋮ Information storage and search complexity theory ⋮ Average case analysis of region search in balanced k-d trees ⋮ Comparison of various trees for nearest-point search with/without the Voronoi diagram. ⋮ Analytic variations on quadtrees

Cites Work

• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

This page was built for publication: Analysis of range searches in quad trees