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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis. Graph Drawing: algorithms for the visualization of graphs. Prentice Hall, 1999.
F. Bertault, P. Eades. Drawing hypergraphs in the subset standard. Springer Verlag, Graph Drawing proceedings, LNCS 1984, 2000.
N. Biggs, E. K. Lloyd, R. J. Wilson. Graph Theory 1736-1936 OUP, 1976.
L. Euler. Lettres a Une Princesse d’Allemagne, vol 2. 1761. Letters No. 102-108.
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.
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.
E. Hammer. Logic and Visual Information. CSLI Publications, Stanford, 1995.
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.
J. Howse, F. Molina, S.-J. Shin, J. Taylor. On diagram tokens and types. Accepted for Diagrams 2002.
S. Kent. Constraint diagrams: Visualising invariants in object oriented models. proceedings of OOPSLA97, ACM SIGPLAN Notices 32, 1997.
F. Molina. Reasoning with extended Venn-Peirce diagrammatic Systems. PhD Thesis, University of Brighton, 2001.
Object Management Group. UML Specification, Version 1.3: http://www.omg.org.
C. Peirce. Collected Papers. Harvard University Press, 1933.
M. Schaefer and D. Štefanikovič. Decidability of string graphs. Proc 33rd ACM Symposium on the Thy of Comp, p.241–246, 2001.
S.-J. Shin. The Logical Status of Diagrams. CUP, 1994.
J. Venn. On the diagrammatic and mechanical representation of propositions and reasonings. Phil.Mag., 1880. 123.
J. Warmer and A. Kleppe. The Object Constraint Language: Precise Modeling with UML. Addison-Wesley, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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