Analysis of range searches in quad trees

DOI10.1016/0020-0190(75)90034-4MaRDI QIDQ1216951zbMATH OpenOpenAlexFDO

Authors Donald F. Stanat, Jon 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)

Cites work

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216951)