Rectangular layouts and contact graphs

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Buchsbaum, Adam L ^a,c   Gansner, Emden R ^a,c   Procopiuc, Cecilia M ^a,c   Venkatasubramanian, Suresh ^b,d  

^a AT and T Labs

^b UNIVERSITY OF UTAH   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d University of Utah   (United States)

Author keywords

Contact graphs; Rectangular duals; Rectangular layouts

Indexed keywords

CONTACT GRAPHS; RECTANGULAR DUALS; RECTANGULAR LAYOUTS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY; NUMERICAL METHODS; OPTIMIZATION;

GRAPH THEORY;

EID: 42149145341     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328919     Document Type: Article

References (58)

1. ACCORNERO, A., ANCONA, M., AND VARINI, S. 2000. All separating triangles in a plane graph can be optimally "broken" in polynomial time. Int. J. Found. Comput. Sci. 11, 3, 405-421.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
3. ANDREEV, E. M. 1970a. On convex polyhedra in Lobachevski spaces. Mat. ∼Spornik 81, 123, 445-478.
4. ANDREEV, E. M. 1970b. On convex polyhedra of finite volume in Lobachevski space. Mat. ∼Spornik 83, 125, 256-260.
5. BHASKER, J., AND SAHNI, S. 1988. A linear algorithm, to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247-278.
6. BIEDL, T., BRETSCHER, A., AND MEIJER, H. 1999. Rectangle of influence drawings of graphs without filled 3-cycles. In Proceedings of the 7th International Symposium on Graph Drawing. Lecture Notes in Computer Science, vol. 1731. Springer, 359-368.
7. BIEDL, T., KANT, G., AND KAUFMANN, M. 1997. On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19, 427-446.
8. BRANDSTÄDT, A., LE, V. B., AND SPINRAD, J. P. 1999. Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA.
9. DE BERG, M., CARLSSON, S., AND OVERMARS, M. H. 1992. A general approach to dominance in the plane. J. Algor. 13, 2, 274-296.
10. DE FRAYSSEIX, H., DE MENDEZ, P. O., AND ROSENSTIEHL, P. 1994. On triangle contact graphs. Combinator. Probab. Comput. 3, 233-246.
11. DI BATTISTA, G., EADES, P., TAMASSIA, R., AND TOLLIS, I. 1999. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River, NJ.
12. DI BATTISTA, G., LENHART, W., AND LIOTTA, G. 1994. Proximity drawability: A survey. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD). Lecture Notes in Computer Science, vol. 894. Springer, 328-339.
13. GABOW, H. N. 1990. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), 434-443.
14. GABRIEL, K. R., AND SOKAL, R. R. 1969. A new statistical approach to geographical analysis. Syst. Zoo. 18, 54-64.
15. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
16. HAREL, D., AND TARJAN, R. E. 1984. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 2, 338-355.
17. HE, X. 2001. A simple linear time algorithm for proper box rectangular drawings of plane graphs. J. Algor. 40, 1, 82-101.
18. HE, X. 1993. On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22, 6, 1218-1226.
19. HLINĚNÝ, P. 1998. Classes and recognition of curve contact graphs. J. Combinator. Theory (B) 74, 1, 87-103.
20. HLINĚNÝ, P., AND KRATOCHVÍ L, J. 2001. Representing graphs by disks and balls (a survey of recognition-complexity results). Discr. Math. 229, 1-3, 101-124.
21. JAROMCZYK, J. W., AND TOUSSAINT, G. T. 1992. Relative neighborhood graphs and their relatives. Proc. IEEE 80, 1502-1517.
22. KANT, G., AND HE, X. 1997. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172, 175-193.
23. KOEBE, P. 1936. .Kontaktprobleme der konformen Abbildung. Berichte über die Verhand-lungen der Sächsischen, Akad. WIM., Math.-Phys. Klass 88, 141-164.
24. KOŹMIŃSKI, K., AND KINNEN, W. 1988. Rectangular dualization and rectangular dissections. IEEE Trans. Circ. Syst. 35, 11, 1401-1416.
25. KOŹMIŃSKI, K., AND KINNEN, W. 1985. Rectangular duals of planar graphs. Netw. 15, 145-157.
26. LAI, Y.-T., AND LEINWAND, S. M. 1990. A theory of rectangular dual graphs. Algorithmica 5, 467-483.
27. LAI, Y.-T., AND LEINWAND, S. M. 1988. Algorithms for floorplan design via rectangular dualization. IEEE Trans. Comput.-Aided Des. 7, 1278-1289.
28. LAPAUGH, A. S. 1980. Algorithms for integrated circuit layout: An analytic approach. Ph.D. thesis, Massachusetts Institute of Technology.
29. LIOTTA, G., LUBIW, A., MEIJER, H., AND WHTTESIDES, S. H. 1998. The rectangle of influence drawability problem. Comput. Geom. Theory Appl. 10, 1-22.
30. MCKEE, T. A., AND MCMORRIS, F. R. 1999. Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA.
31. MULLER, D. E., AND PREPARATA, F. P. 1978. Finding the intersection of two convex polyhedra. Theor. Comput. Sci. 7, 2, 217-236.
32. MUNKRES, J. R. 1999. Topology: A First Course. Prentice-Hall of India, New Delhi.
33. OVERMARS, M. H., AND WOOD, D. 1988. On rectangular visibility. J. Algor. 9, 3, 372-390.
34. PAN, P., SHI, W., AND LIU, C. L. 1996. Area minimization for hierarchical floorplans. Algorithmica 15, 550-571.
35. RAHMAN, M. S., NISHIZEKI, T., AND GHOSH, S. 2004. Rectangular drawings of planar graphs. J. Algor. 50, 1, 62-78.
36. RAHMAN, M. S., NAKANO, S.-I., AND NISHIZEKI, T. 2000. Box-Rectangular drawings of plane graphs. J. Algor. 37, 2, 363-398.
37. RAHMAN, M. S., NAKANO, S.-I., AND NISHIZEKI, T. 1998. Rectangular grid drawings of plane graphs. Comput. Geom. Theory Appl. 10, 3, 203-220.
38. RAMAKRISHNAN, R., AND GEHRKE, J. 2000. Database Management Systems. McGraw-Hill, Boston, MA.
39. READ, R. C. 1987. A new method for drawing a graph given the cyclic order of the edges at each vertex. Congressus Numer. 56, 31-44.
40. ROSENSTIEHL, P., AND TARJAN, R. E. 1986. Rectilinear planar layouts and bipolar orientations of planar graphs. Discr. Comput. Geom. 1, 343-353.
41. SACHS, H. 1994. Coin graphs, polyhedra, and conformal mapping. Discr. Math. 134, 133-138.
42. SCHIEBER, B., AND VISHKIN, U. 1988. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput. 17, 6, 1253-1262.
43. SHI, W. 1996. A fast algorithm, for area minimization of slicing floorplans. IEEE Trans. Comput.-Aided Des. Integr. Cire. Syst. 15, 12, 1525-1532.
44. STEADMAN, P. 1976. Graph-Theoretic representation of architectural arrangement. In The Architecture of Form, L. March, Ed. Cambridge University Press, 94-115.
45. STOCKMEYER, L. 1983. Optimal orientations of cells in slicing floorplan designs. Inf. Control 57, 91-101.
46. SUR-KOLAY, S., AND BHATTACHARYA, B. B. 1991. On the family of inherently nonslicible floorplans in VLSI layout design. In Proceedings of the IEEE International Conference on Circuits and Systems, vol. 5. 2850-2853.
47. SUR-KOLAY, S., AND BHATTACHARYA, B. B. 1988. Inherent nonslicability of rectangular duals in VLSI floorplanning. In Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 338. Springer, 88-107.
48. TANT, K., TSUKIYAMA, S., SHINODA, S., AND SHIRAKAWA, I. 1991. On area-efficient drawings of rectangular duals for VLSI floor-plan. Math. Program. 52, 29-43.
49. TARJAN, R. E. 1979. Applications of path compression on balanced trees. J. ACM 26, 4, 690-715.
50. THOMASSEN, C. 1984. Plane representations of graphs. In Progress in Graph Theory, J. A. Bondy and U. S. R. Murty, eds. Academic Press, Canada, 43-69.
51. THOMASSEN, C. 1986. Interval representations of planar graphs. J. Combinator. Theory (B) 40, 9-20.
52. THURSTON, W. P. The geometry and topology of 3-manifolds. Princeton University Notes (unpublished).
53. UNGAR, P. 1953. On diagrams representing maps. J. London Math. Soc. 28, 336-342.
54. WEST, D. B. 1996. Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, NJ.
55. WHITNEY, H. 1933. 2-Isomorphic graphs. Amer. J. Math. 55, 245-254.
56. WIMER, S., KOREN, I., AND CEDERBAUM, I. 1988. Floorplans, planar graphs, and layouts. IEEE Trans. Circ. Syst. 35, 3, 267-278.
57. YEAP, G. K., AND SARRAFZADEH, M. 1995. Sliceable floorplanning by graph dualization. SIAM J. Discr. Math. 8, 2, 258-280.
58. YEAP, G. K., AND SARRAFZADEH, M. 1993. A unified approach to floorplan sizing and enumeration. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 12, 12, 1858-1867.