Rectangular drawings of planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 244-255

  Rahman, Md Saidur ^a   Nishizeki, Takao ^a   Ghosh, Shubhashis ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

A-PLANE; EMBEDDINGS; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; PLANAR GRAPH; VERTICAL LINES;

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); GRAPHIC METHODS;

GRAPH THEORY;

EID: 84867445544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3, pp. 247-278, 1988.
2. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis. Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
3. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22(6), pp. 1218-1226, 1993.
4. X. He, A simple linear time algorithm for proper box rectangular drawings of plane graphs, Journal of Algorithms, 40(1), pp. 82-101, 2001.
5. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput., 2(3), pp. 135-158, 1973.
6. G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172, pp. 175-193, 1997.
7. K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. 21st DAC, Albuquerque, pp. 655-656, 1984.
8. T. Lengauer, Combinatirial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.
9. S. Munemoto, N. Katoh and G. Imamura, Finding an optimal floor layout based on an orthogonal graph drawing algorithm, J. Archit. Plann. Enviroment Eng. AIJ, No. 524, pp. 279-286, 2000.
10. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
11. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl., 10(3), pp. 203-220, 1998.
12. M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Alg. Appl., 3, No.4, pp. 31-62, 1999.
13. M. S. Rahman, S. Nakano and T. Nishizeki, Box-rectangular drawings of plane graphs, Journal of Algorithms, 37(2), pp. 363-398, 2000.
14. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Comp. Geom. Theo. Appl., 21(3), pp. 121-138, 2002.
15. K. Tani, S. Tsukiyama, S. Shinoda and I. Shirakawa, On area-efficient drawings of rectangular duals for VLSI floor-plan, Mathematical Programming, 52, pp. 29-43, 1991.
16. C. Thomassen, Plane representations of graphs, (Eds.) J. A. Bondy and U. S. R. Murty, Progress in Graph Theory, Academic Press Canada, pp. 43-69, 1984.
17. C. Thomassen, Plane cubic graphs with prescribed face areas, Combinatorics, Probability and Computing, 1, pp. 371-381, 1992.
18. P. Ungar, On diagrams representing maps, J. London Math. Soc., 28, pp. 336-342, 1953.