This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
New data structures for orthogonal range searching
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
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
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, pp.198, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.