A sweeping line algorithm based on two dimensional region search

The authors present a new plane-sweep algorithm which is based on several primitive functions of region query for a number of overlapped rectangles in 2-D space. A theorem proves that the presented algorithm can be built from any spatial data structure with region query functions. Experimental results presented show that this algorithm has been successfully implemented in C language based on two kinds of spatial data structures, the multiple storage quad tree and the quad list quad tree. This algorithm can be performed in a time complexity of O(N log N).<<ETX>>

[1]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  John K. Ousterhout,et al.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Wu-Shiung Feng,et al.  Using a multiple storage quad tree on a hierarchical VLSI compaction scheme , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Y.S. Kuo,et al.  A data structure for fast region searches , 1989, IEEE Design & Test of Computers.

[6]  V. Klee.  Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? , 1977 .

[7]  Hanan Samet,et al.  Hierarchical representations of collections of small rectangles , 1988, CSUR.

[8]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[9]  Chia-Chun Tsai,et al.  An H-V Tile-Expansion Router , 1990, J. Inf. Sci. Eng..

[10]  Ludo Weyten,et al.  Quad list quad trees: a geometrical data structure with improved performance for large region queries , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Jonathan B. Rosenberg,et al.  Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Wu-Shiung Feng,et al.  An edge-oriented compaction scheme based on multiple storage quad tree , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[13]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[14]  Randy Lee Brown.  Multiple Storage Quad Trees: A Simpler Faster Alternative to Bisector List Quad Trees , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Chia-Chun Tsai,et al.  Expert compactor: a knowledge-based application in VLSI layout compaction , 1991 .