Abstract
Many diagrammatic languages are based on closed curves, and various wellformedness conditions are often enforced (such as the curves are simple). We use the term Euler diagram in a very general sense, to mean any .nite collection of closed curves which express information about intersection, containment or disjointness. Euler diagrams have many applications, including the visualization of statistical data [1], displaying the results of database queries [6] and logical reasoning [2, 4, 5]. Three important questions are: for any given piece of information can we draw a diagram representing that information, can we reliably interpret the diagrams and can we reason diagrammatically about that information? The desirable answer to all three questions is yes, but these desires can be con.icting. In this article we investigate the e.ects of enforcing the simplicity condition (as in [1, 2, 6]) or not enforcing it (as in [4, 5]).
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 subscriptionsReferences
Chow, S., Ruskey, F.: Drawing area-proportional Venn and Euler diagrams. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 466–477. Springer, Heidelberg (2004)
Hammer, E.: Logic and Visual Information. CSLI Publications, Stanford (1995)
Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS Journal of Computation and Mathematics 8, 145–194 (2005)
Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1994)
Swoboda, N., Allwein, G.: Heterogeneous reasoning with Euler/Venn diagrams containing named constants and FOL. In: Proceedings of Euler Diagrams 2004. ENTCS, vol. 134. Elsevier Science, Amsterdam (2005)
Verroust, A., Viaud, M.-L.: Ensuring the drawability of Euler diagrams for up to eight sets. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol. 2980, pp. 128–141. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fish, A., Stapleton, G. (2006). Defining Euler Diagrams: Simple or What?. In: Barker-Plummer, D., Cox, R., Swoboda, N. (eds) Diagrammatic Representation and Inference. Diagrams 2006. Lecture Notes in Computer Science(), vol 4045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783183_14
Download citation
DOI: https://doi.org/10.1007/11783183_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35623-3
Online ISBN: 978-3-540-35624-0
eBook Packages: Computer ScienceComputer Science (R0)