A Space-efficient Algorithm for Finding the Connected Components of Rectangles in the Plane
Name
MIT-LCS-TM-323.pdf
Size
4.52 MB
Format
Adobe PDF
Checksum (MD5)
bb64fe448f951e8b0d6d316ee56ebee5
Author(s)
Leiserson, Charles E.
Phillips, Cynthia A.
Date Issued
February 1987
Series/Report no.
MIT-LCS-TM-323
Abstract
We present an algorithm for determining the connectivity of a set of N rectangles in the plane, a problem central to avoiding aliasing in VLSI design rule checkers. Previous algorithms for this problem either worked slowly with a small amount of primary memory space, or worked quickly but used more space. Our algorithm uses O(W) primary memory space, where W, the scan width, is the maximum number of rectangles to cross any vertical cut. The algorithm runs in O(N lg N) time and requires no more than O(N) transfers between primary and secondary memory.
Persistent DSpace Link
