Optimal polygonal representation of planar graphs

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

Volumn 6034 LNCS, Issue , 2010, Pages 417-432

  Gansner, E R ^a   Hu, Y F ^a   Kaufmann, M ^b   Kobourov, S G ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX POLYGON; LINEAR-TIME ALGORITHMS; LOWER BOUNDS; PLANAR GRAPH; POLYGONAL REPRESENTATION; UPPER BOUND;

GRAPHIC METHODS; INFORMATION SCIENCE;

GRAPH THEORY;

EID: 77953511033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12200-2_37     Document Type: Conference Paper

References (31)

1. Battista, G.D., Lenhart, W., Liotta, G.: Proximity drawability: A survey. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 328-339. Springer, Heidelberg (1995)
2. Biedl, T., Bretscher, A., Meijer, H.: Rectangle of influence drawings of graphs without filled 3-cycles. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 359-368. Springer, Heidelberg (1999)
3. Bruls, M., Huizing, K., van Wijk, J.J.: Squarified treemaps. In: Proc. Joint Eurographics/IEEE TVCG Symp. Visualization, VisSym., pp. 33-42 (2000)
4. Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1) (2008)
5. Chrobak, M., Payne, T.: A linear-time algorithm for drawing planar graphs. Inform. Process. Lett. 54, 241-246 (1995)
6. de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics 309(7), 1794-1812 (2009)
7. de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing 3, 233-246 (1994)
8. de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Procs. 20th Symposium on Theory of Computing (STOC), pp. 426-433 (1988)
9. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41-51 (1990)
10. Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographical analysis. Systematic Zoology 18, 54-64 (1969)
11. He, X.: On finding the rectangular duals of planar triangular graphs. SIAM Journal of Computing 22(6), 1218-1226 (1993)
12. He, X.: On floor-plan of plane graphs. SIAMJournal of Computing 28(6), 2150-2167 (1999)
13. Hliněný, P.: Classes and recognition of curve contact graphs. Journal of Comb. Theory (B) 74(1), 87-103 (1998)
14. Hliněný, P., Kratochvíl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics 229(1-3), 101-124 (2001)
15. Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM 21(4), 549-568 (1974)
16. Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proceedings of the IEEE 80, 1502-1517 (1992)
17. Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 263-276. Springer, Heidelberg (1993)
18. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4-32 (1996) (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia)
19. Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172, 175-193 (1997) (Pubitemid 127451829)
20. Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse 88,141-164 (1936)
21. Koźmiński, K., Kinnen, W.: Rectangular dualization and rectangular dissections. IEEE Transactions on Circuits and Systems 35(11), 1401-1416 (1988)
22. Lai, Y.-T., Leinwand, S.M.: Algorithms for floorplan design via rectangular dualization. IEEE Transactions on Computer-Aided Design 7, 1278-1289 (1988)
23. Lai, Y.-T., Leinwand, S.M.: A theory of rectangular dual graphs. Algorithmica 5, 467-483 (1990)
24. Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. Journal of Algorithms 48, 441-451 (2003)
25. Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Computational Geometry: Theory and Applications 10, 1-22 (1998)
26. Rahman, M., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. Journal of Algorithms 50(1), 62-78 (2004)
27. Read, R.C.: A new method for drawing a graph given the cyclic order of the edges at each vertex. Congressus Numerantium 56, 31-44 (1987)
28. Steadman, P.: Graph-theoretic representation of architectural arrangement. In: March, L. (ed.) The Architecture of Form, pp. 94-115. Cambridge University Press, Cambridge (1976)
29. Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43-69 (1982)
30. Thomassen, C.: Interval representations of planar graphs. Journal of Comb. Theory (B) 40, 9-20 (1988)
31. Yeap, G.K., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM Journal on Discrete Mathematics 8(2), 258-280 (1995)