Skip to main content
SpringerLink
Log in

Generating Euler Diagrams

  • Conference paper
  • First Online:
Diagrammatic Representation and Inference (Diagrams 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2317))

Included in the following conference series:

Abstract

This article describes an algorithm for the automated generation of any Euler diagram starting with an abstract description of the diagram. An automated generation mechanism for Euler diagrams forms the foundations of a generation algorithm for notations such as Harel’s higraphs, constraint diagrams and some of the UML notation. An algorithm to generate diagrams is an essential component of a diagram tool for users to generate, edit and reason with diagrams.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis. Graph Drawing: algorithms for the visualization of graphs. Prentice Hall, 1999.

    Google Scholar 

  2. F. Bertault, P. Eades. Drawing hypergraphs in the subset standard. Springer Verlag, Graph Drawing proceedings, LNCS 1984, 2000.

    Google Scholar 

  3. N. Biggs, E. K. Lloyd, R. J. Wilson. Graph Theory 1736-1936 OUP, 1976.

    Google Scholar 

  4. L. Euler. Lettres a Une Princesse d’Allemagne, vol 2. 1761. Letters No. 102-108.

    Google Scholar 

  5. J. Gil, J. Howse, S. Kent. Formalising Spider Diagrams. Proc. IEEE Symposium on Visual Languages (VL99), Tokyo, Sept 1999. IEEE Comp Soc Press, 130–137.

    Google Scholar 

  6. J. Gil, J. Howse, S. Kent, J. Gil. Towards a formalisation of constraint diagrams. Proc IEEE Symp on Human-Centric computing (HCC’01). Stresa, Sept 2001, p.72–79.

    Google Scholar 

  7. E. Hammer. Logic and Visual Information. CSLI Publications, Stanford, 1995.

    MATH  Google Scholar 

  8. J. Howse, F. Molina, J. Taylor. On the completeness and expressiveness of spider diagram systems. Proc. Diagrams 2000, Edinburgh, Sept 2000. LNAI 1889, Springer-Verlag, 26–41.

    Google Scholar 

  9. J. Howse, F. Molina, S.-J. Shin, J. Taylor. On diagram tokens and types. Accepted for Diagrams 2002.

    Google Scholar 

  10. S. Kent. Constraint diagrams: Visualising invariants in object oriented models. proceedings of OOPSLA97, ACM SIGPLAN Notices 32, 1997.

    Google Scholar 

  11. F. Molina. Reasoning with extended Venn-Peirce diagrammatic Systems. PhD Thesis, University of Brighton, 2001.

    Google Scholar 

  12. Object Management Group. UML Specification, Version 1.3: http://www.omg.org.

  13. C. Peirce. Collected Papers. Harvard University Press, 1933.

    Google Scholar 

  14. M. Schaefer and D. Štefanikovič. Decidability of string graphs. Proc 33rd ACM Symposium on the Thy of Comp, p.241–246, 2001.

    Google Scholar 

  15. S.-J. Shin. The Logical Status of Diagrams. CUP, 1994.

    Google Scholar 

  16. J. Venn. On the diagrammatic and mechanical representation of propositions and reasonings. Phil.Mag., 1880. 123.

    Google Scholar 

  17. J. Warmer and A. Kleppe. The Object Constraint Language: Precise Modeling with UML. Addison-Wesley, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Mathematical Sciences, University of Brighton, Lewes Road, BN2 4GJ, Brighton, UK

    Jean Flower & John Howse

Authors
  1. Jean Flower
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Howse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, 93106, Santa Barbara, CA, USA

    Mary Hegarty

  2. School of Computer Science and Software Engineering, Monash University, Clayton Campus, Wellington Road, 3800, Victoria, Australia

    Bernd Meyer

  3. Department of Computer Science and Software Engineering, Auburn University, 107 Dunstan Hall, 36849, Auburn, AL, USA

    N. Hari Narayanan

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flower, J., Howse, J. (2002). Generating Euler Diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds) Diagrammatic Representation and Inference. Diagrams 2002. Lecture Notes in Computer Science(), vol 2317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46037-3_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-46037-3_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46037-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation