Ontology highlight
ABSTRACT:
SUBMITTER: de Berg M
PROVIDER: S-EPMC6428404 | biostudies-literature | 2018
REPOSITORIES: biostudies-literature
de Berg Mark M Gudmundsson Joachim J Mehrabi Ali D AD
Algorithmica 20171031 11
We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q . We present data structures of size O ( n · polylog n ) and with query time O ( ( k + 1 ) · polylog n ) time, where <i>k</i> is the number of reported pairs, for two classes of objects in R 2 : axis-aligned rectangles and objects with small union complexity. For the 3-dimensional case where ...[more]