Issue No. 07 - July (1980 vol. 29)
J.L. Bentley , Departments of Computer Science and Mathematics, Carnegie-Mellon University
In this paper we investigate the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane. This problem arises in applications such as design rule checking of very large-scale integrated (VLSI) circuits and architectural databases. We describe an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found. This algorithm is optimal to within a constant factor. As an intermediate step of this algorithm, we solve a problem related to the range searching problem that arises in database applications. Although the algorithms that we describe are primarily theoretical devices (being very difficult to code), they suggest other algorithms that are quite practical.
VLSI design rule checking, Computational geometry, geometric intersection problems, optimal algorithms, range searching
J. Bentley and D. Wood, "An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles," in IEEE Transactions on Computers, vol. 29, no. , pp. 571-577, 1980.