The Community for Technology Leaders
Green Image
Issue No. 03 - March (1982 vol. 31)
ISSN: 0018-9340
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 log<sup>2</sup><inf>2</inf>n + k) time and 0(n log<sup>2</sup><inf>2</inf>n) space algorithm is developed for the
tree of trees structures, Bounding boxes, computational geometry, data structures, d-ranges, range tree, rectangles, segment tree
D. Wood, H.W. Six, "Counting and Reporting Intersections of d-Ranges", IEEE Transactions on Computers, vol. 31, no. , pp. 181-187, March 1982, doi:10.1109/TC.1982.1675973
103 ms
(Ver 3.3 (11022016))