Algorithm for extracting integrated circuit critical areas associated with point defects

The problem of reporting all overlap areas between two sets of rectilinearly-oriented rectangles in the plane is considered. This problem arises in applications such as the extraction of integrated circuit chip critical area associated with any point defect. An algorithm that solves this problem in a time proportional to n√n, on average, where n is the total number of rectangles, is proposed.