On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
Introduction to VLSI Systems
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
SCG '87 Proceedings of the third annual symposium on Computational geometry
Interoperability of Data Parallel Runtime Libraries
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
IEEE Transactions on Computers
IEEE Transactions on Computers
Counting and Reporting Intersections of d-Ranges
IEEE Transactions on Computers
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Computational Geometry on a Systolic Chip
IEEE Transactions on Computers
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
An algorithm for optimal two-dimensional compaction of VLSI layouts
Integration, the VLSI Journal
A systolic VLSI matrix for a family of fundamental searching problems
Integration, the VLSI Journal
A new randomized data structure for the 11/2-dimensional range query problem
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Finding Rectangle Intersections by Divide-and-Conquer
IEEE Transactions on Computers
A dynamic sort-based DDM matching algorithm for HLA applications
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
An exact incremental hidden surface removal algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles
Information Processing Letters
Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 15.00 |
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.