Rectangular grid drawings of plane graphs

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

Volumn 1090, Issue , 1996, Pages 92-105

  Saidur Rahman, Md ^a   Nakano, Shin Ichi ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

A-PLANE; GRID POINTS; LINEAR-TIME ALGORITHMS; PLANE GRAPHS; RECTANGULAR GRIDS; UPPER BOUND; VERTICAL LINES;

GRAPH THEORY;

EID: 84949008898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_142     Document Type: Conference Paper

References (13)

1. J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3 (1988), pp. 247-278.
2. N. Chiba, K. Onoguchi, and T. Nishizeki, Drawing planar graphs nicely, Acta Informatica, 22 (1985), pp. 187-201.
3. M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs, Technical Report, UCR-CS-94-5, Department of Computer Science, University of California at Riverside, 1994.
4. G. de Battista, P. Eades, R. Tamassia and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comp. Geom. Theory Appl., to appear.
5. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
6. X. He, An efficient parallel algorithm for finding rectangular duals of plane triangulated graphs, Algorithmica 13 (1995), pp. 553-572.
7. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22(6) (1993), pp. 1218-1226.
8. G. Kant and X. He, Two algorithms for finding rectangular duals of planar graphs, Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG'93 Proceedings, (1994), pp. 396-410.
9. 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, June (1984), pp. 655-656.
10. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
11. W. Schnyder, Embedding planar graphs in the grid, Proc. first ACM-SIAM Symp. on Discrete Algorithms, San Francisco, (1990), pp. 138-147.
12. K. Tani, S. Tsukiyama, S. Shinoda and I. Shirakawa, On area-efficent drawings of rectangular duals for VLSI floor-plan, Mathematical Programming 52 (1991), pp. 29-43.
13. C. Thomassen, Plane representations of graphs, (Eds.) J. A. Bondy and U. S. R. Murty, Progress in Graph Theory, Academic Press Canada, (1984), pp. 43-69.