Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
Data Structures and Algorithms
2012-01-16 v1
Abstract
This work studies the problem of 2-dimensional searching for the 3-sided range query of the form 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.
Cite
@article{arxiv.1201.2702,
title = {Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time},
author = {Gerth Stølting Brodal and Alexis C. Kaporis and Apostolos N. Papadopoulos and Spyros Sioutas and Konstantinos Tsakalidis and Kostas Tsichlas},
journal= {arXiv preprint arXiv:1201.2702},
year = {2012}
}