On finding an empty staircase polygon of largest area (width) in a planar point-set

Computational Geometry: Theory and Applications

Volumn 26, Issue 2, 2003, Pages 143-171

  Nandy, Subhas C ^a   Bhattacharya, Bhargab B ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Algorithms; Complexity; Geometric graph theory; Permutation graphs

Indexed keywords

EID: 84867945532     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(03)00015-4     Document Type: Article

References (25)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber Geometric applications of a matrix-searching algorithm Algorithmica 2 1987 195 208
2. A. Aggarwal, and S. Suri Fast algorithm for computing the largest empty rectangle Proc. 3rd Annual ACM Symposium on Computational Geometry 1987 278 290
3. A. Asano, M. Sato, and T. Ohtsuki Computational geometric algorithms T. Ohtsuki, Layout Design and Verification, Advances in CAD for VLSI, Vol. 4 1986 North-Holland Amsterdam 295 347
4. J.E. Boyce, D.P. Dobkin, R.L. Drysdale, and L.J. Guibas Finding extremal polygons SIAM J. Comput. 14 1985 134 147
5. S.-W. Cheng Widest empty L-shaped corridor Inform. Process. Lett. 58 1996 277 283
6. B. Chazelle, R.L. Drysdale, and D.T. Lee Computing the largest empty rectangle SIAM J. Comput. 15 1986 300 315
7. J. Cong, T. Kong, and D.Z. Pan Buffer block planning for interconnect-driven floorplanning Proc. ACM/IEEE Int. Conf. on Computer-Aided Design (ICCAD) 1999 358 363
8. J. Cong, T. Kong, and D.Z. Pan Interconnect delay estimation models for synthesis and design planning Proc. Asia South Pacific Design Automation Conference 1999 97 100
9. C.C.N. Chu, and D.F. Wong Closed form solution to simultaneous buffer insertion/sizing and wire sizing Proc. Int. Symp. on Physical Design 1997 192 197
10. S. Das, and B.B. Bhattacharya Channel routing in Manhattan-diagonal model Proc. 9th Int. Conf. on VLSI Design 1996 IEEE CS Press 43 48
11. S. Das, S. Sur-Kolay, and B.B. Bhattacharya Routing through a staircase in Manhattan-diagonal model Proc. 11th Int. Conf. on VLSI Design 1998 IEEE CS Press 65 70
12. P.S. Dasgupta, P. Pan, S.C. Nandy, and B.B. Bhattacharya Monotone bipartitioning problem in a planar point set with applications to VLSI ACM Trans. Design Automation of Electronic Systems (TODAES) 7 2 2002 231 248
13. P.S. Dasgupta, A.K. Sen, S.C. Nandy, and B.B. Bhattacharya Searching networks with unrestricted arc costs IEEE Trans. Systems Man Cybernat. Part A 31 2001 497 507
14. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
15. 2) problems in computational geometry Computational Geometry 5 1995 165 185
16. M. Guruswamy, and D.F. Wong Channel routing order for building-block layout with rectilinear modules Proc. Int. Conf. on Computer-Aided Design (ICCAD) 1988 184 187
17. Y. Kajitani Order of channels for safe routing and optimal compaction of routing area IEEE Trans. Computer-Aided Design CAD-2 1983 293 300
18. S. Majumder, S.C. Nandy, and B.B. Bhattacharya Partitioning VLSI floorplans by staircase channels for global routing Proc. Int. Conf. on VLSI Design 1998 IEEE CS Press 59 64
19. S. Majumder, S. Sur-Kolay, B.B. Bhattacharya, and S.C. Nandy Area(Number)-balanced hierarchy of staircase channels with minimum crossing nets Proc. Int. Symp. on Circuits and Systems (ISCAS), Vol. 5 2001 395 398
20. A. Naamad, D.T. Lee, and L. Hsu On the maximum empty rectangle problem Discrete Appl. Math. 8 1984 267 277
21. S.C. Nandy, B.B. Bhattacharya, and S. Ray Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design Proc. 10th. International Conference on Foundation of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science 472 1990 Springer-Verlag Berlin 255 269
22. G.J.E. Rawlins, and D. Wood Orthoconvexity and its generalizations G. Toussaint, Computational Morphology 1988 Elsevier Science Amsterdam 137 152
23. N. Sherwani Algorithms for VLSI Physical Design Automation 3rd Edition 1999 Kluwer Academic Boston
24. P. Sarkar, and C.-K. Koh Routability-driven repeater block planning for interconnect-centric floorplanning IEEE Trans. Computer-Aided Design 20 2001 660 671
25. S. Sur-Kolay, and B.B. Bhattacharya The cycle structure of nonslicible floorplans and a unified algorithm for feasible routing order Proc Int. Conf. on Computer Design (ICCD) 1991 524 527