A new approach to rectangle intersections
Author:
- 1 January 1983
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 13 (3-4) , 221-229
Abstract
The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.Keywords
This publication has 6 references indexed in Scilit:
- Counting and Reporting Intersections of d-RangesIEEE Transactions on Computers, 1982
- Finding intersection of rectangles by range searchJournal of Algorithms, 1981
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- The rectangle intersection problem revisitedBIT Numerical Mathematics, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Decomposable searching problemsInformation Processing Letters, 1979