This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1982 (vol. 31 no. 3)
pp. 181-187
H.W. Six, Institut f?r Angewandte Informatik und Formale Beschreibungverfahren, Universit?t Karlsruhe
We present a solution to the problem of reporting and counting all pairs of intersecting or overlapping d-ranges in a given set of n d-ranges. A d-range is a rectilinearly oriented rectangular d-dimensional box or brick. The three-dimensional case is presented in some detail and an 0(n log22n + k) time and 0(n log22n) space algorithm is developed for the
Index Terms:
tree of trees structures, Bounding boxes, computational geometry, data structures, d-ranges, range tree, rectangles, segment tree
Citation:
H.W. Six, D. Wood, "Counting and Reporting Intersections of d-Ranges," IEEE Transactions on Computers, vol. 31, no. 3, pp. 181-187, March 1982, doi:10.1109/TC.1982.1675973
Usage of this product signifies your acceptance of the Terms of Use.