International Symposium on Graph Drawing and Network Visualization

Graph Drawing and Network Visualization pp 556-557 | Cite as

Knuthian Drawings of Series-Parallel Flowcharts

  • Michael T. Goodrich
  • Timothy Johnson
  • Manuel Torres
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

In 1963, Knuth published the first paper on a computer algorithm for a graph drawing problem, entitled “Computer-drawn Flowcharts” [8]. In this paper, Knuth describes an algorithm that takes as input an n-vertex directed graph G that represents a flowchart and, using the modern language of graph drawing, produces an orthogonal drawing of G.

Notes

Acknowledgments

This work was supported in part by the NSF under grants 1011840 and 1228639 and DARPA under agreement no. AFRL FA8750-15-2-0092. The views expressed are those of the authors and do not reflect the official policy or position of the Department of Defense or the U.S. Government.

References

  1. 1.
    Bertolazzi, P., Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. Int. J. Comput. Geom. Appl. 04(04), 385–402 (1994)CrossRefGoogle Scholar
  2. 2.
    Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Comput. Geom. 45(1), 141–160 (2011)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Chan, T.M., Goodrich, M.T., Kosaraju, S., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. 23(2), 153–162 (2002)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297–310. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  5. 5.
    Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 06(03), 333–356 (1996)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Goodrich, M.T., Johnson, T., Torres, M.: Knuthian drawings of series-parallel flowcharts. ArXiv ePrint, (2015). http://arxiv.org/abs/1508.03931
  7. 7.
    Hong, S.-H., Eades, P., Lee, S.-H.: Drawing series parallel digraphs symmetrically. Comput. Geom. 17(34), 165–188 (2000)MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Knuth, D.E.: Computer-drawn flowcharts. Commun. ACM 6(9), 555–563 (1963)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Timothy Johnson
    • 1
  • Manuel Torres
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations