Time efficient VLSI artwork analysis algorithms in GOALIE2

New algorithms used in the GOALIE2 circuit extraction system, based on representing VLSI layout geometries as trapezoids, are presented in this paper. These include polygon-to-trapezoid decomposition, scanline management, and output sorting. In particular, the scanline algorithm virtually eliminates all redundant computation present in similar systems. These algorithms enable us to perform VLSI layout analysis in nearly linear time.

[1]  Christopher J. Van Wyk,et al.  Space Efficient Algorithms for VLSI Artwork Analysis , 1983, 20th Design Automation Conference Proceedings.

[2]  Henry S. Baird.  Fast algorithms for LSI artwork analysis , 1977, DAC '77.

[3]  Anoop Gupta.  ACE: A Circuit Extractor , 1983, 20th Design Automation Conference Proceedings.

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

[5]  Ulrich Lauther.  An O (N log N) Algorithm for Boolean Mask Operations , 1981, 18th Design Automation Conference.

[6]  Thomas Szymanski,et al.  Goalie: A Space Efficient System for VLSI Artwork Analysis , 1985, IEEE Design & Test of Computers.

[7]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[8]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[9]  Bernard Chazelle,et al.  An optimal algorithm for intersecting line segments in the plane , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.