A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane

The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<
>