Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
From MaRDI portal
Publication:1235007
DOI10.1007/BF00263763zbMath0349.68016WikidataQ55920347 ScholiaQ55920347MaRDI QIDQ1235007
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
An application of $m$-ary trees to the design of data structures for geometric searching problems, Optimal binary search trees, An improved algorithm for the maximum agreement subtree problem, Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems, The extendible cell method for closest point problems, Average case analysis of region search in balanced k-d trees, Dynamic orthogonal range queries in OLAP., An algorithm for handling many relational calculus queries efficiently., A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, Information storage and search complexity theory, Chaining algorithms for multiple genome comparison