Two general methods for dynamizing decomposable searching problems

DOI10.1007/BF02241781MaRDI QIDQ1149778zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, J. Van Leeuwen

Publication date 1981

Published in Computing (Search for Journal in Brave)

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

zbMATH Keywords

deletionsinsertionsintersection of halfspacesmerge techniquequad-trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3617566 (Why is no real title available?)
• Decomposable searching problems
• Maintenance of configurations in the plane
• Multidimensional binary search trees used for associative searching

Cited in

(6)

• An algorithm for handling many relational calculus queries efficiently.
• Efficient splitting and merging algorithms for order decomposable problems.
• Some principles for dynamizing decomposable searching problems
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Optimal dynamization of decomposable searching problems
• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems

This page was built for publication: Two general methods for dynamizing decomposable searching problems

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