Rectangle and square representations of planar graphs

Thirty Essays on Geometric Graph Theory

Volumn 9781461401100, Issue , 2013, Pages 213-248

  Felsner, Stefan ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949179084     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4614-0110-0_12     Document Type: Chapter

References (60)

1. M.J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S.G. Kobourov, T. Ueckerdt, Computing cartograms with optimal complexity. In Proceedings of the 2012 symposuim on Computational Geometry (SoCG'12). ACM, Chapel Hill, North Carolina, USA, pp. 21-30 (2012)
2. A.L. Buchsbaum, E.R. Gansner, C.M. Procopiuc, S. Venkatasubramanian, Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1), 8-28 (2008)
3. I. Benjamini, L. Lovász, Harmonic and analytic functions on graphs. J. Geom. 76, 3-15 (2003)
4. B. Bollobas, Modern Graph Theory (Springer-Verlag, New york, 2002)
5. J. Bhasker, S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247-278 (1988)
6. G.R. Brightwell, E.R. Scheinerman, Representations of planar graphs. SIAM J. Discr. Math. 6, 214-229 (1993)
7. R.L. Brooks, C.A.B. Smith, A.H. Stone,W.T. Tutte, The dissection of rectangles into squares. Duke Math. J. 7, 312-340 (1940)
8. J. Chalopin, D. Goncalves, Every planar graph is the intersection graph of segments in the plane, in Proceedings of the 41st ACM Symposium on Theory of Computing (STOC), Bethesda, Maryland, USA, pp. 631-638 (2009)
9. M. Dehn, Über zerlegung von rechtecken in rechtecke. Math. Ann. 57, 314-332 (1903)
10. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing (Prentice Hall, Englewood Cliffs, NJ, 1999)
11. H. de Fraysseix, P. Ossona de Mendez, On topological aspects of orientation. Discr. Math. 229, 57-72 (2001)
12. H. de Fraysseix, P. Ossona de Mendez, J. Pach, A left-first search algorithm for planar graphs. Discr. Comput. Geom. 13, 459-468 (1995)
13. H. de Fraysseix, P. Ossona de Mendez, P. Rosenstiehl, Bipolar orientations revisited. Discr. Appl. Math. 56, 157-179 (1995)
14. P.G. Doyle, J. Snell, Random Walks and Electric Networks (Math. Assoc. of America, 1984). http://math.dartmouth.edu/doyle/docs/walks/walks.pdf. Accessed on Sept 25, 2012
15. M. Eiglsperger, S. Fekete, G.W. Klau, Orthogonal graph drawing, in Drawing Graphs: Methods and Models. LNCS, vol. 2025 (Tutorial) (Springer-Verlag, 2001), pp. 121-171
16. D. Eppstein, E. Mumford, B. Speckmann, K. Verbeek, Area-universal rectangular layouts, in Proceedings of the 25th Symposium on Computational Geometry, Aarhus, Denmark, pp. 267-276 (2009)
17. S. Felsner, Geometric Graphs and Arrangements. Advanced Lectures in Mathematics (Vieweg Verlag Wiesbaden, 2004)
18. S. Felsner, Lattice structures from planar graphs. Electr. J. Comb. 11(R15), 24 pp. (2004)
19. S. Felsner, É. Fusy, M. Noy, D. Orden, Bijections for Baxter families and related objects. J. Comb. Theor. A 18, 993-1020 (2011)
20. S. Felsner, C. Huemer, S. Kappes, D. Orden, Binary labelings for plane quadrangulations and their relatives. Discr. Math. Theor. Comput. Sci. 12(3), 115-138 (2010)
21. J.-H. Fan, C.-C. Lin, H.-I. Lu, H.-C. Yen, Width-optimal visibility representations of plane graphs, in Proceedings of the 18th International Conference on Algebraic and Computation (ISAAC). LNCS, vol. 4835 (Springer, 2007), pp. 160-171
22. E. Fusy, Combinatoire des cartes planaires et applications algorithmiques. Ph.D. thesis, LIX Ecole Polytechnique, 2007. http://www.lix.polytechnique.fr/fusy/Articles/these eric fusy.pdf. Accessed on Sept 25, 2012
23. E. Fusy, Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discr. Math. 309(7), 1870-1894 (2009)
24. J. Graver, B. Servatius, H. Servatius, Combinatorial Rigidity. Grad. Stud. in Math., vol. 2 (American Math. Soc., Providence, RI, 1993)
25. X. He, On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22(6), 1218-1226 (1993)
26. P. Hliněný, Contact graphs of line segments are NP-complete. Discr. Math. 235, 95-106 (2001)
27. I.-A. Hartman, I. Newman, R. Ziv, On grid intersection graphs. Discr. Math. 87, 41-52 (1991)
28. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, W. Whiteley, Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31, 31-61 (2005)
29. X. He, H. Zhang, Nearly optimal visibility representations of plane graphs. SIAM J. Discr. Math. 22, 1364-1380 (2008)
30. R. Kenyon, Tilings and discrete Dirichlet problems. Isr. J. Math. 105, 61-84 (1998)
31. G. Kant, X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172, 175-193 (1997)
32. G. Kirchhoff, Über die Auflösung der lichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72, 497-508 (1847)
33. K. Koźmiński, E. Kinnen, Rectangular duals of planar graphs. Networks 15, 145-157 (1985)
34. J. Kratochvíl, A. Kuběna, On intersection representations of co-planar graphs. Discr. Math. 178, 251-255 (1998)
35. P. Koebe, Kontaktprobleme der konformen Abbildung. Ber. Sächs. Akad. Wiss. Leipzig, Math.-Phys. Kl. 88, 141-164 (1936)
36. R.W. Kenyon, S. Sheffield, Dimers, tilings and trees. J. Comb. Theor. Ser. B 92, 295-317 (2004)
37. C.-C. Liao, H.-I. Lu, H.-C. Yen, Compact floor-planning via orderly spanning trees. J. Algorithms 48(2), 441-451 (2003)
38. L. Lovász, Geometric representations of graphs. http://www.cs.elte.hu/lovasz/geomrep.pdf. Draft version 11 Dec 2009
39. A. Lee, I. Streinu, Pebble game algorithms and sparse graphs. Discr. Math. 308, 1425-1437 (2008)
40. K. Miura, H. Haga, T. Nishizeki, Inner rectangular drawings of plane graphs. Int. J. Comput. Geom. Appl. 16(2-3), 249-270 (2006) [in English]
41. G.L. Miller, J. Naor, Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24, 1002-1017 (1995)
42. S. Mozes, C. Wulff-Nilsen, Shortest paths in planar graphs with real lengths in O(nlog2 n/loglogn) time, in ESA 2010. LNCS, vol. 6347 (Springer, 2010), pp. 206-217
43. T. Nishiseki, M.S. Rhaman, Planar Graph Drawing (World Scientific, Singapore, 2004)
44. M. Rahman, T. Nishizeki, S. Ghosh, Rectangular drawings of planar graphs. J. Algorithms 50(1), 62-78 (2004)
45. M. Rahman, S.-i. Nakano, T. Nishizeki, Box-rectangular drawings of plane graphs. J. Algorithms 37(2), 363-398 (2000)
46. P. Rosenstiehl, Embedding in the plane with orientation constraints: the angle graph. Ann. NY Acad. Sci. 555, 340-346 (1989)
47. P. Rosenstiehl, R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. Comput. Geom. 1, 343-353 (1986)
48. H. Sachs, Coin graphs, polyhedra, and conformal mapping, Discr. Math. 134(1-3), 133-138 (1994)
49. O. Schramm, Square tilings with prescribed combinatorics. Isr. J. Math. 84, 97-118 (1993)
50. J. Skinner, C. Smith, W. Tutte, On the dissection of rectangles into right-angled isosceles triangles, J. Comb. Theor. Ser. B 80, 277-319 (2000)
51. K. Stephenson, Introduction to Circle Packing: The Theory of Discrete Analytic Functions (Cambridge University Press, Cambridge, 2005)
52. S. Sadasivam, H. Zhang, NP-completeness of st-orientations for plane graphs. Theor. Comput. Sci. 411, 995-1003 (2010)
53. R. Tamassia, On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 421-444 (1987)
54. C. Thomassen, Plane representations of graphs, in Progress in Graph Theory, ed. by Bondy, Murty (Academic Press, 1984), pp. 336-342
55. R. Tamassia, I.G. Tollis, A unified approach to visibility representations of planar graphs. Discr. Comput. Geom. 1, 321-341 (1986)
56. W. Tutte, The dissection of equilateral triangles into equilateral triangles. Proc. Camb. Phil. Soc. 44, 463-482 (1948)
57. W.T. Tutte, Squaring the square, in 2nd Scientific American Book of Mathematical Puzzles and Diversions, ed. byM. Gardner (University of Chicago Press, Chicago, 1987). http://www. squaring.net/history theory/brooks smith stone tutte II.html. Accessed on Sept 25, 2012
58. T. Ueckerdt, Geometric representations of graphs with low polygonal complexity. Ph.D. thesis, Technische Universität Berlin, 2011
59. P. Ungar, On diagrams representing graphs. J. Lond. Math. Soc. 28, 336-342 (1953)
60. H. Zhang, X. He, Visibility representation of plane graphs via canonical ordering tree. Inform. Process. Lett. 96, 41-48 (2005)