On floor-plan of plane graphs

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2150-2167

  He, Xin ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; THEOREM PROVING;

DISJOINT RECTILINEAR POLYGONAL REGIONS; PLANE GRAPHS;

GRAPH THEORY;

EID: 0033348663     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796308874     Document Type: Article

References (25)

1. J. BHASKER AND S. SAHNI, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks, 17 (1987), pp. 307-317.
2. J. BHASKER AND S. SAHNI, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3 (1988), pp. 247-278.
3. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, North Holland, Amsterdam, 1979.
4. N. CHIBA AND N. TAKAO, Arboricity and subgraph listing algorithms, SIAM J. Comput., 14 (1985), pp. 210-223.
5. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom., 4 (1994), pp. 235-282.
6. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
7. X. HE, On finding the rectangular duals of planar triangular graphs, SIAM J. Comput., 22 (1993), pp. 1218-1226.
8. X. HE, An efficient parallel algorithm for finding rectangular duals of planar triangular graphs, Algorithmica, 13 (1995), pp. 553-572.
9. W. R. HELLER, G. SORKIN, AND K. MAILING, The planar package planner for system designers, in Proceedings of the 19th Annual IEEE Design Automation Conference, New York, 1982, pp. 253-260.
10. J. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. ACM, 21 (1974), pp. 549-568.
11. G. KANT, Drawing planar graphs using the lmc-ordering, in Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, Pittsburgh, 1992, pp. 101-110.
12. G. KANT AND X. HE, Two algorithms for finding rectangular duals of planar graphs, in Proceedings of the 19th Workshop on Graph-Theoretic Concepts in Computer Science, 1993. LNCS 790, pp. 396-410.
13. G. KANT AND X. HE, Regular edge labeling of 4-connected, plane graph and its applications in graph drawing algorithms, Theoret. Comput. Sci., 172 (1997), pp. 175-193.
14. K. KOŹMIŃSKI AND E. KINNEN, Rectangular dual of planar graphs, Networks, 15 (1985), pp. 145-157.
15. K. KOŹMIŃSKI AND E. KINNEN, Rectangular dualization and rectangular dissection, IEEE Trans. Circuits and Systems, 35 (1988), pp. 1401-1416.
16. Y.-T. LAI AND S. M. LEINWAND, A theory of rectangular dual graphs, Algorithmica, 5 (1990), pp. 467-483.
17. K. MAILING, S. H. MUELLER, AND W. R. HELLER, On finding most optimal rectangular package plans, in Proceedings of the 19th Annual IEEE Design Automation Conference, New York, 1982, pp. 263-270.
18. M. S. RAHMAN, S. NAKANO, AND T. NISHIZEKI, Rectangular grid drawings of plane graphs, Comput. Geom., 10 (1998), pp. 203-220.
19. Y. SUN AND M. SARRAFZADEH, Floor-planning by graph dualization: L-shaped models, in Proceedings of the IEEE International Symposium on Circuits and Systems, 1990, pp. 2845-2848.
20. Y. SUN AND K-H. YEAP, Edge covering of complex triangles in rectangular dual floor-planning, J. Circuits Systems Comput., 3 (1993), pp. 721-731.
21. P. G. TAIT, Remarks on coloring of maps, in Proc. Roy. Soc. Edinburgh Sect. A. 10 (1880), p. 729.
22. C. THOMASSEN, Plane representations of graphs, in Progress in Graph Theory, J. A. Bondy, and U. S. R. Murty, eds., Academic Press, Canada, 1984, pp. 43-69.
23. S. TSUKIYAMA, K. KOIKE, AND I. SHIRAKAWA, An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI Floorplan, in Proceedings of the IEEE Int. Symp. on Circuits and Systems, 1986, pp. 321-324.
24. W. T. TUTTE, On Hamiltonian circuits, J. London Math. Soc., 21 (1946), pp. 98-101.
25. K.-H. YEAP AND M. SARRAFZADEH, Floor-planning by graph dualization: 2-concave rectilinear modules, SIAM J. Comput., 22 (1993), pp. 500-526.