Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2003: Algorithms and Computation pp 2–5Cite as

Drawing Plane Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2906))

Abstract

Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33]. In this talk we survey the recent results on these drawings of plane graphs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhasker, J., Sahni, S.: A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247–278 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Biedl, T.C.: Optimal orthogonal drawings of triconnected plane graphs. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 333–344. Springer, Heidelberg (1996)

    Google Scholar 

  3. Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing planar graphs nicely. Acta Inform. 22, 187–201 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 153–173. Academic Press, London (1984)

    Google Scholar 

  5. Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7, 211–223 (1997)

    Article  MathSciNet  Google Scholar 

  6. Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Computational Geometry: Theory and Applications 10, 29–54 (1998)

    MathSciNet  Google Scholar 

  7. Chrobak, M., Payne, T.: A linear-time algorithm for drawing planar graphs on a grid. Information Processing Letters 54, 241–246 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Automatic graph drawing: an annotated bibliography. Computational Geometry: Theory and Applications 4, 235–282 (1994)

    MATH  MathSciNet  Google Scholar 

  9. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  10. Fáry, I.: On straight lines representation of plane graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)

    Google Scholar 

  11. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Garg, A., Tamassia, R.: A new minimum cost flow algorithm with applications to graph drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 201–226. Springer, Heidelberg (1996)

    Google Scholar 

  13. He, X.: On finding the rectangular duals of planar triangulated graphs. SIAM J. Comput. 22(6), 1218–1226 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. He, X.: Grid embedding of 4-connected plane graphs. Discrete & Computational Geometry 17, 339–358 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. He, X.: A simple linear time algorithm for proper box-rectangular drawings of plane graphs. Journal of Algorithms 4(1), 82–101 (2001)

    Article  Google Scholar 

  16. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4–32 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. 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)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kozminski, K., Kinnen, E.: An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits. In: Proc. 21st DAC, pp. 655–656 (1984)

    Google Scholar 

  19. Lengauer, T.: Combinatirial Algorithms for Integrated Circuit Layout. John Wiley & Sons, Chichester (1990)

    Google Scholar 

  20. Munemoto, S., Katoh, N., Imamura, G.: Finding an optimal floor layout based on an orthogonal graph drawing algorithm. J. Archit. Plann. Environment Eng. AIJ 524, 279–286 (2000)

    Google Scholar 

  21. Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of four-connected plane graphs. Discrete & Computational Geometry 26, 73–87 (2001)

    MATH  MathSciNet  Google Scholar 

  22. Miura, K., Nakano, S., Nishizeki, T.: Convex grid drawings of four-connected plane graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 254–265. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Nishizeki, T., Miura, K., Rahman, M.S.: Algorithms for drawing plane graphs. Trans. of IEICE (to appear)

    Google Scholar 

  24. Rahman, M.S., Nishizeki, T.: Bend-minimum orthogonal drawings of plane 3-graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 265–276. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  25. Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular grid drawings of plane graphs. Comp. Geom. Theo. Appl. 10(3), 203–220 (1998)

    MATH  MathSciNet  Google Scholar 

  26. Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. Journal of Graph Alg. Appl. 3(4), 31–62 (1999)

    MATH  MathSciNet  Google Scholar 

  27. Rahman, M.S., Nakano, S., Nishizeki, T.: Box-rectangular drawings of plane graphs. Journal of Algorithms 37(2), 363–398 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular drawings of plane graphs without designated corners. Comp. Geom. Theo. Appl. 21(3), 121–138 (2002)

    MATH  MathSciNet  Google Scholar 

  29. Schnyder, W.: Embedding planar graphs in the grid. In: Proc. 1st Annual ACMSIAM Symp. on Discrete Algorithms, San Francisco, pp. 138–147 (1990)

    Google Scholar 

  30. Schnyder, W., Trotter, W.: Convex drawings of planar graphs. Abstracts of the AMS 13(5), 92T-05-135 (1992)

    Google Scholar 

  31. Stein, S.K.: Convex maps. Proc. Amer. Math. Soc. 2, 464–466 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  32. Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43–69. Academic Press, Canada (1984)

    Google Scholar 

  33. Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13, 743–768 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  34. Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung 46, 26–32 (1936)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, Sendai, 980-8579, Japan

    Takao Nishizeki

Authors
  1. Takao Nishizeki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nishizeki, T. (2003). Drawing Plane Graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation