Affiliation:
1. Dept. of Computer Science, University of Bonn, Römerstrasse 164, 53117 Bonn, Germany
Abstract
In this paper we present a linear space dynamic data structure for two-dimensional orthogonal range reporting and emptiness queries. This data structure answers range reporting queries in time [Formula: see text] for any ε > 0 and k the size of the answer. Our data structure also supports emptiness and one-reporting queries in time O( log n log log n). The model of computation used in this paper is a unit-cost RAM model.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献