Batched dynamic solutions to decomposable searching problems
From MaRDI portal
Publication:3707419
DOI10.1016/0196-6774(85)90030-6zbMath0584.68076OpenAlexW2016582666MaRDI QIDQ3707419
Mark H. Overmars, Herbert Edelsbrunner
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16244
streaminghyper-rectanglesspace requirementsbatched dynamic version of a searching problemintersecting pairsset problems
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information storage and retrieval of data (68P20)
Related Items
An algorithm for handling many relational calculus queries efficiently. ⋮ Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ A practical divide-and-conquer algorithm for the rectangle intersection problem ⋮ Counting and reporting red/blue segment intersections ⋮ FAST SOFTWARE FOR BOX INTERSECTIONS ⋮ The 2-center problem in three dimensions ⋮ External-memory algorithms for processing line segments in geographic information systems ⋮ Off-line dynamic maintenance of the width of a planar point set ⋮ Efficient splitting and merging algorithms for order decomposable problems.
