Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
Abstract
This work studies the problem of 2-dimensional searching for the 3-sided range query of the form [a, b]× (-∞, c] in both main and external memory, by considering a variety of input distributions. We present three sets of solutions each of which examines the 3-sided problem in both RAM and I/O model respectively. The presented data structures are deterministic and the expectation is with respect to the input distribution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.