Octagonal drawings of plane graphs with prescribed face areas

Computational Geometry: Theory and Applications

Volumn 42, Issue 3, 2009, Pages 214-230

  Rahman, Md Saidur ^a   Miura, Kazuyuki ^b   Nishizeki, Takao ^c  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b FUKUSHIMA UNIVERSITY   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; Graph drawing; Octagonal drawing; Prescribed face area; VLSI floorplanning

Indexed keywords

EID: 84867970453     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.09.002     Document Type: Article

References (21)

1. N. Chiba, and T. Nishizeki Arboricity and subgraph listing algorithms SIAM Journal on Computing 14 1 1985 210 223
2. M. de Berg, E. Mumford, and B. Speckmann On rectilinear duals for vertex-weighted plane graphs Proc. of Graph Drawing 2005 Lect. Notes in Computer Science vol. 3843 2006 Springer 61 72
3. M. de Berg, E. Mumford, B. Speckmann, Optimal BSPs and rectilinear cartograms, in: Proc. 14th Ann. ACM Int. Symp. on Advances in Geographic Information Systems, 2006, pp. 19-26
4. X. He On floorplans of planar graphs SIAM Journal on Computing 28 6 1999 2150 2167
5. A. Kawaguchi, and H. Nagamochi Orthogonal drawings for plane graphs with specified face areas Proc. 4th Int. Conf. on Theory and Applications of Models of Computation Lect. Notes in Computer Science vol. 4484 2007 Springer 584 594
6. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout 1990 John Wiley & Sons Chichester
7. M.S. Rahman, K. Miura, and T. Nishizeki Octagonal drawings of plane graphs with prescribed face areas Proc. of WG 2004 Lect. Notes in Computer Science vol. 3353 2004 Springer 320 331
8. M.S. Rahman, S. Nakano, and T. Nishizeki Rectangular grid drawings of plane graphs Computational Geometry: Theory and Applications 10 3 1998 203 220
9. M.S. Rahman, S. Nakano, and T. Nishizeki A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs Journal of Graph Algorithms and Applications 3 4 1999 31 62 http://jgaa.info
10. M.S. Rahman, M. Naznin, and T. Nishizeki Orthogonal drawings of plane graphs without bends Journal of Graph Algorithms and Applications 7 4 2003 335 362 http://jgaa.info
11. J. Storer On minimum node-cost planar embeddings Networks 14 1984 181 212
12. W. Shi A fast algorithm for area minimization of slicing floorplans IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15 12 1996 1525 1532
13. Y. Sun, and M. Sarrafzadeh Floorplanning by graph dualization: L-shaped modules Algorithmica 10 1998 429 456
14. S.M. Sait, and H. Youssef VLSI Physical Design Automation 1999 World Scientific Singapore
15. K. Tani, S. Tsukiyama, S. Shinoda, and I. Shirakawa On area-efficient drawings of rectangular duals for VLSI floor-plan Mathematical Programming 52 1991 29 43
16. R. Tamassia On embedding a graph in the grid with the minimum number of bends SIAM Journal on Computing 16 1987 421 444
17. C. Thomassen Plane representations of graphs J.A. Bondy, U.S.R. Murty, Progress in Graph Theory 1984 Academic Press Canada 43 69
18. C. Thomassen Plane cubic graphs with prescribed face areas Combinatorics, Probability and Computing 1 1992 371 381
19. M. van Kreveld, and B. Speckmann On rectangular cartograms Computational Geometry: Theory and Applications 37 3 2007 175 187
20. K. Yeap, and M. Sarrafzadeh Floor-planning by graph dualization: 2-concave rectilinear modules SIAM Journal on Computing 22 3 1993 500 526
21. K.H. Yeap, and M. Sarrafzadeh Sliceable floorplanning by graph dualization SIAM Journal on Discrete Mathematics 8 2 1995 258 280