Efficient decomposition of polygons into L-shapes with applications to VLSI layouts

ACM Transactions on Design Automation of Electronic Systems

Volumn 1, Issue 3, 1996, Pages 371-395

  Lopez, Mario A ^a   Mehta, Dinesh P ^b  

^a UNIVERSITY OF DENVER   (United States)

^b UNIVERSITY OF TENNESSEE SPACE INSTITUTE   (United States)

Author keywords

Corner stitching; L shapes; Partition; Rectangle; Rectilinear polygons

Indexed keywords

EID: 16444375683     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/234860.234865     Document Type: Article

References (30)

1. BLUST, G. AND MEHTA, D. P. 1993. Corner stitching for L-shaped tiles. In Proceedings of the Third Great Lakes Symposium on VLSI (Kalamazoo, MI, March 5-6), 67-68.
2. CAI, Y. AND WONG, D. F. 1993. On minimizing the number of L-shaped channels in 93 building-block layout. IEEE Trans. Comput. Aided Des. 12, 6, 757-769.
3. CHAZELLE, B. 1991. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485-524.
4. DAI, W. M., ASANO, T., AND KUH, E. 1985. Routing region definition and ordering scheme for building-block layout. IEEE Trans. Comput. Aided Des. 4, 189-197.
5. DU, D. AND ZHANG, Y. 1990. On heuristics for minimum length rectilinear partitions. Algorithmica, 5, 111-128.
6. EDELSBRUNNER, H., O'ROURKE, J., AND WELZL, E. 1984. Stationing guards in rectilinear art galleries. Comput. Vision, Graph. Image Process. 27, 167-176.
7. GONZALEZ, T. F. AND ZHENG, S.-Q. 1990. Approximation algorithms for partitioning rectilinear polygons. Algorithmica, 5, 11-42.
8. GONZALEZ, T. F. AND ZHENG, S.-Q. 1989. Improved bounds for rectangular and guillotine partitions. J. Symbolic Comput. 7 (July), 591-610.
9. GONZALEZ, T. F., RAZZAZI, M., SHING, M.-T., AND ZHENG, S.-Q. 1994. On optimal guillotine partitions approximating optimal d-Box partitions. Comput. Geom. Theor. Appl. 4, 1-11.
10. GONZALEZ, T. F., RAZZAZI, M., AND ZHENG, S.-Q. 1993. An efficient divide-and-conquer algorithm for partitioning into d-Boxes. Int. J. Comput. Geom. Appl. 3, 4, 417-428.
11. HOROWITZ, E., SAHNI, S., AND MEHTA, D. 1995. Fundamentals of Data Structures in C++. Freeman, New York.
12. IMAI, H. AND ASANO, T. 1986. Efficient algorithms for geometric graph search algorithms. SIAM J. Comput. 15 (May), 478-494.
13. INGAS, A. 1983. Heuristics for minimum edge length rectangular partitions of rectilinear figures. In Proceedings of the Sixth GI Conference Theoretical Computer Science, vol. 145, Lecture Notes in Computer Science, Springer-Verlag, 199-210.
14. LINGAS, A., PINTER, R., RIVEST, R., AND SHAMIR, A. 1982. Minimum edge length partitioning of rectilinear polygons. In Proceedings of the 20th Allerton Conference on Commun. Control Comput., 53-63.
15. LIOU, W. T., TAN, J. J. M., AND LEE, R. C. T. 1989. Minimum partitioning of simple rectilinear polygons in O(n loglog n) time. In Proceedings of the Fifth Annual Symposium on Computational Geometry, 344-353.
16. MARPLE, D., SMULDERS, M., AND HEGEN, H. 1990. Tailor: A layout system based on trapezoidal corner stitching. IEEE Trans. Comput. Aided Des. 9, 1, 66-90.
17. MEHTA, D. P., SHANBHAG, A., AND SHERWANI, N. A. 1995. A new approach for floorplanning in MBC designs. Tech. Rep. 95-02, Univ. of Tennessee Space Institute.
18. NAHAR, S. AND SAHNI, S. 1988. A fast algorithm for polygon decomposition. IEEE Trans. Comput. Aided Des. 7 (April), 478-483.
19. OHTSUKI, T. 1982. Minimum dissection of rectilinear regions. In Proceedings of the 1982 International Symposium on Circuits and Systems (ISCAS), 1210-1213.
20. O'ROURKE, J. 1994. Computational Geometry in C. Cambridge University Press, New York.
21. O'ROURKE, J. 1983. An alternate proof of the rectilinear art gallery theorem. J. Geom. 21, 118-130.
22. OUSTERHOUT, J. K. 1984. Corner stitching: A data structuring technique for VLSI layout tools. IEEE Trans. Comput. Aided Des. 3, 1, 87-100.
23. OUSTERHOUT, J., HAMACHI, G., MAYO, R., SCOTT, W., AND TAYLOR, G. 1984. Magic: A VLSI layout system. In Proceedings of the 21st Design Automation Conference, 152-159.
24. SEQUIN, C. H. AND FAÇANHA, H. D. S. 1993. Corner stitched tiles with curved boundaries. IEEE Trans. Comput. Aided Des. 12, 1, 47-58.
25. SHANBHAG, A. G., DANDA, S. R., AND SHERWANI, N. 1994. Floorplanning for mixed macro block and standard cell designs. In Proceedings of the Fourth Great Lakes Symposium on VLSI (Notre Dame, IN, March 4-5), 26-29.
26. SHERWANI, N. 1995. Algorithms for VLSI Physical Design Automation. Kluwer, Boston, MA.
27. WANG, T. AND WONG, D. F. 1990. An optimal algorithm for floorplan area optimization. In Proceedings of the 27th Design Automation Conference, 180-186.
28. WU, S. AND SAHNI, S. 1991. Fast algorithms to partition simple rectilinear polygons. Int. J. Comput. Aided VLSI Des. 3, 241-270.
29. WU, S. AND SAHNI, S. 1990. Covering rectilinear polygons by rectangles. IEEE Trans. Comput. Aided Des. 9 (April), 377-388.
30. YEAP, K. AND SARRAFZADEH, M. 1993. Floorplanning by graph dualization: 2-Concave rectilinear modules. SIAM J. Comput. 22 (June), 500-526.