Skip to main content
SpringerLink
Log in

On the aesthetics of diagrams

Summary of talk

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1998)

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

Included in the following conference series:

Abstract

Given the recent move towards visual languages in real-world system specification and design, the need for algorithmic procedures that produce clear and eye-pleasing layouts of complex diagrammatic entities arises in full force. This talk addresses a modest, yet still very difficult version of the problem, in which the diagrams are merely general undirected graphs with straight-line edges.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Di Battista, G., P. Eades, R. Tamassia and I. G. Tollis, “Algorithms for Automatic Graph Drawing: An Annotated Bibliography” Technical Report, Dept. of Computer Science, Brown University, Providence, 1993.

    Google Scholar 

  2. Booth, K.S. and G.S. Lueker, “Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms” J. Comput. Syst. Sci. 13 (1976), 335–379.

    MathSciNet  Google Scholar 

  3. Chiba, N., T. Nishizeki, S. Abe, and T. Ozawa, “A Linear Algorithm for Embedding Planar Graphs Using PQ-trees” J. Comput. Syst. Sci. 30:1 (1985), 54–76.

    Article  MathSciNet  Google Scholar 

  4. Chrobak, M. and T.H. Payne, “A Linear Time Algorithm for Drawing a Planar Graph on a Grid” Inf. Proc. Lett. 54 (1995), 241–246.

    Article  MathSciNet  Google Scholar 

  5. Davidson, R. and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing” ACM Transactions on Graphics 15 (Oct. 1996), 301–331. (Also, Technical report, The Weizmann Institute of Science, Rehovot, Israel, 1989.)

    Article  Google Scholar 

  6. Eades, P., “A Heuristic for Graph Drawing” Cong. Numer. 42 (1984), 149–160.

    MathSciNet  Google Scholar 

  7. Fraysseix, H. de, J. Pach, and R. Pollack, “Small Sets Supporting Fáry Embeddings of Planar Graphs” In Proc. 20th ACM Symp. on Theory of Comput., pp. 426–433, 1988.

    Google Scholar 

  8. Harel, D., “On Visual Formalisms” Comm. ACM 31 (1988), 514–530.

    Article  MathSciNet  Google Scholar 

  9. Harel, D. and M. Sardas, “Randomized Graph Drawing with Heavy-Duty Preprocessing” J. Visual Lang. and Comput. 6 (1995), 233–253.

    Article  Google Scholar 

  10. Harel, D., and M. Sardas, “An Algorithm for Straight-Line Drawing of Planar Graphs” Algorithmica, in press.

    Google Scholar 

  11. Jayakumar, R., K. Thulasiraman and M.N.S. Swamy, “O(n 2) Algorithm for Graph Planarization” IEEE Trans. on Computer-Aided Design 8:3 (1989), 257–267.

    Article  Google Scholar 

  12. Kant, G., “An O(n 2) Maximal Planarization Algorithm Based on PQ-trees” Technical Report RUU-CS-92-03, Dept. of Computer Science, Utrecht University, The Netherlands, 1992.

    Google Scholar 

  13. Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi, “Optimization by Simulated Annealing” Science 220 (1983), 671–680.

    MathSciNet  Google Scholar 

  14. Lempel, A., S. Even and I. Cederbaum, “An Algorithm for Planarity Testing of Graphs” In Theory of Graphs: International Symposium (P. Rosenstiehl, Ed.), Gordon and Breach, New York, 1967, pp. 215–232.

    Google Scholar 

  15. Tamassia, R., G. Di Battista and C. Batini, ”Automatic Graph Drawing and Readability of Diagrams” IEEE Trans. on Systems, Man and Cybernetics, 18 (1988), 61–79.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Weizmann Institute of Science, Rehovot, Israel

    David Harel

Authors
  1. David Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Johan Jeuring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harel, D. (1998). On the aesthetics of diagrams. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054280

Download citation

  • DOI: https://doi.org/10.1007/BFb0054280

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64591-7

  • Online ISBN: 978-3-540-69345-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation