The Community for Technology Leaders
RSS Icon
Subscribe
Redondo Beach, California
Nov. 12, 2000 to Nov. 14, 2000
ISBN: 0-7695-0850-2
pp: 198
S. Alstrup , Dept. of IT, Copenhagen Univ., Denmark
G. Stolting Brodal , Dept. of IT, Copenhagen Univ., Denmark
T. Rauhe , Dept. of IT, Copenhagen Univ., Denmark
ABSTRACT
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in R/sup 3/, we achieve query time O(log n+k) using space O(n log/sup 1+/spl epsiv// n), where n denotes the number of stored points and k the number of points to be reported. For the range reporting problem on an n/spl times/n grid, we achieve query time O(log log n+k) using space O(n log/sup /spl epsiv// n). For the two-dimensional semi-group range sum problem we achieve query time O(log n) using space O(n log n).
INDEX TERMS
data structures; search problems; data structures; orthogonal range searching; general range reporting problem; two-dimensional semi-group range sum problem
CITATION
S. Alstrup, G. Stolting Brodal, T. Rauhe, "New data structures for orthogonal range searching", FOCS, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 198, doi:10.1109/SFCS.2000.892088
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool