Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Applications of computational geometry to VLSI layout pattern design
Integration, the VLSI Journal
An algorithm for polygon conversion to boxes for VLSI layouts
Integration, the VLSI Journal
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
An O (N log N) algorithm for Boolean mask operations
DAC '81 Proceedings of the 18th Design Automation Conference
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Time-efficient VLSI artwork analysis algorithms in GOALIE2
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Fracturing (i.e., filling area by rectangles) is one of the most important tasks of an artwork system for a pattern generator. Growing chip complexity requires efficient algorithms to perform this non-trivial data transformation. In order to solve this problem, we developed a fracture system using a new approach and improved algorithms. Its key features are the use of plane sweep techniques and the subdivision of the task in processing rectilinear shaped area and all angle shaped area. The manhattan area algorithm supplies an almost optimal rectangle dissection. The coverage of the remaining area is achieved in a good heuristical manner. Both algorithms guarantee to converge and find a complete filling. No restrictions are imposed on the area to be handled. The system has a time complexity of O(n log n). Additionally an outlook on hierarchical fracturing is presented.