A new approach to rectangle intersections part I

References

• Bentley , J. L. 1979 . Decomposable searching problems . Inf. Proc. Lett. , 8 : 244 – 251 .
   Web of Science ®Google Scholar
• Bentley , J. L. and Wood , D. 1980 . An optimal worst case algorithm for reporting intersections on rectangles . IEEE Tr. on Comp. , C-29 : 571 – 577 .
   Web of Science ®Google Scholar
• Edelsbrunner H. Dynamic rectangle intersection searching Report F47, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980
   Google Scholar
• Edelsbrunner H. A time- and space-optimal solution of the planar all intersecting rectangles problem Report F50, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980
   Google Scholar
• Edelsbrunner H. Dynamic data structures for orthogonal intersection queries Report F59, Inst. for Inf. Proc. Techn. Univ. of Graz Austria 1980
   Google Scholar
• Fredman , M. L. 1981 . A lower bound on the complexity of orthogonal range queries . J. of the ACM , 28 : 696 – 705 .
   Web of Science ®Google Scholar
• Lee , D. T. and Wong , C. K. 1981 . Finding intersections of rectangles by range search . J. of Algorithms , 2 : 337 – 347 .
   Web of Science ®Google Scholar
• McCreight E. M. Efficient algorithms for enumerating intersecting intervals and rectangles 1980 Report CSL-80-9, XEROX Parc, Palo Alto, Cal.
   Google Scholar
• Six , H.-W. and Wood , D. 1980 . The rectangle intersection problem revisited . BIT , 20 : 426 – 433 .
   Google Scholar
• Six , H.-W. and Wood , D. 1982 . Counting and reporting intersections of d-ranges . IEEE Tr. on Comp. , C-31 : 181 – 187 .
   Web of Science ®Google Scholar
• Willard D. E. New data structures for orthogonal queries Report TR-22–78, Aiken Comp. Lab., Harvard Univ. Cambr, Mass 1978
   Google Scholar