Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

DOI10.1007/BF00263763MaRDI QIDQ1235007zbMATH OpenOpenAlexWikidataFDO

Authors K. Appert

Publication date 1977

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00263763

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(21)

• 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.
• K-d tree based approach for point location problem in explicit model predictive control
• Fast model predictive control combining offline method and online optimization with K-D tree
• An algorithm for handling many relational calculus queries efficiently.
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Fine-grained complexity theory: conditional lower bounds for computational geometry
• A kd-tree-accelerated hybrid data-driven/model-based approach for poroelasticity problems with multi-fidelity multi-physics data
• Ranked document selection
• Information storage and search complexity theory
• Chaining algorithms for multiple genome comparison
• An application of m-ary trees to the design of data structures for geometric searching problems
• A measure-theoretic interpretation of sample based numerical integration with applications to inverse and prediction problems under uncertainty
• Optimal binary search trees
• A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
• Multicriteria optimization techniques for understanding the case mix landscape of a hospital
• Index structures for fast similarity search for real vectors. II
• Algorithms and hardness for multidimensional range updates and queries

This page was built for publication: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

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