Batched dynamic solutions to decomposable searching problems
Edelsbrunner, Herbert
Overmars, Mark
The batched static version of a searching problem asks for performing a given set of queries on a given set of objects. All queries are known in advance. The batched dynamic version of a searching problem is the following: given a sequence of insertions, deletions, and queries, perform them on an initially empty set. We will develop methods for solving batched static and batched dynamic versions of searching problems which are in particular applicable to decomposable searching problems. The techniques show that batched static (dynamic) versions of searching problems can often be solved more efficiently than by using known static (dynamic) data structures. In particular, a technique called “streaming” is described that reduces the space requirements considerably. The methods have also a number of applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using only O(n) space.
Elsevier
1985
info:eu-repo/semantics/article
doc-type:article
text
http://purl.org/coar/resource_type/c_6501
https://research-explorer.ista.ac.at/record/4112
Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching problems. <i>Journal of Algorithms</i>. 1985;6(4):515-542. doi:<a href="https://doi.org/10.1016/0196-6774(85)90030-6">10.1016/0196-6774(85)90030-6</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.1016/0196-6774(85)90030-6
info:eu-repo/semantics/altIdentifier/issn/0196-6774
info:eu-repo/semantics/altIdentifier/issn/1090-2678
info:eu-repo/semantics/closedAccess