The problem of finding the connected components of
rectangles in the plane, which has an application in VLSI layout
to find the equi-potential components. Using the plane-sweep
paradigm and an appropriate data structure, an \$O(n log n)\$-time
algorithm is developed.